stablegradients/pie-gem5-pairs huggingface dataset:
// Slower C++ solution:
#include<iostream>

#include<cstring>

#include<cstdio>

using namespace std;

typedef long long ll;

const int maxn = 1000010;

const int inf = 0x3f3f3f3f;

ll dp[maxn];

ll n, W;

ll v[maxn];

ll w[maxn];

inline ll max(ll x, ll y) {

	return x > y ? x : y;

}

inline ll min(ll x, ll y) {

	return x < y ? x : y;

}

int main() {

	memset(dp, 0x3f, sizeof(dp));

	ios::sync_with_stdio(false);

	cin.tie(0);

	cout.tie(0);

	cin >> n >> W;

	for (int i = 1; i <= n; i++)

		cin >> w[i] >> v[i];

	ll ans = 0ll;

	dp[0] = 0;

	for (int i = 1; i <= n; i++){

		for (int j = 1e5; j >= v[i]; --j){

			dp[j] = min(dp[j], dp[j - v[i]] + w[i]);

			if (dp[j] <= W) ans = max(ans, (ll)(j));

		}

	}

	cout << ans;

	return 0;

}

// Faster C++ solution for the same problem (measured speedup: 11.077247338093231x):
#include <bits/stdc++.h>

#include <set>

using namespace std;

#define mp             make_pair

#define pb             push_back

#define fi             first

#define se             second

#define sz(x)          (int)((x).size())

#define fill(x, y)     memset(x, y, sizeof(y))

#define all(x)         (x).begin(), (x).end()

typedef long long      ll;

typedef pair<int, int> ii;

typedef pair<ii, int>  iii;

typedef vector<int>    vi;

typedef vector<ii>     vii;

typedef vector<iii>    viii;



const ll INF = 1000000100;



int main() {

  ios::sync_with_stdio(false);

  cin.tie(0);

  ll N, W;

  cin >> N >> W;



  ll w[N+1];

  int v[N+1];



  int V = 0;

  for (int i = 1; i <= N; i++) {

    cin >> w[i] >> v[i];

    V += v[i];

  }



  ll dp[N+1][V+1];

  for (int i = 0; i <= V; i++) {

      dp[0][i] = INF;

  }

  for (int i = 0; i <= N; i++) {

      dp[i][0] = 0;

  }



  for (int i = 1; i <= N; i++) {

      for (int j = 1; j <= V; j++) {

          if (v[i] > j) {

              dp[i][j] = dp[i-1][j];

          } else {

              dp[i][j] = min(dp[i-1][j], dp[i-1][j-v[i]]+w[i]);

          }

      }

  }



  int opt = 0;

  for (int i = 0; i <= N; i++) {

      for (int j = 0; j <= V; j++) {

          if (dp[i][j] <= W) {

              opt = max(opt, j);

          }

      }

  }

  cout << opt << "\n";



  return 0;

}
// Slower C++ solution:
/*

    Mbak Rose Dong

*/

#include<bits/stdc++.h>

using namespace std;

long long int weight[105], value[105];

long long int dp[100100];

int main()

{

    int n, i, j, k, curr, m, ans;

    int tc;

    int w;

    scanf("%d %d",&n,&w);

    for(i=1;i<=n;i++)

    {

        scanf("%lld %lld",&weight[i], &value[i]);

    }

    for(i=1;i<=100000;i++)

        dp[i] = 1e15;

    dp[0] = 0;

    for(i=1;i<=n;i++)

    {

        for(j=100000-value[i];j>=0;j--)

        {

            dp[j+value[i]] = min(dp[j+value[i]], dp[j] + weight[i]);

        }

    }

    for(i=100000;i>=0;i--)

    {

        if(dp[i] <= w)

        {

            printf("%d\n",i);

            return 0;

        }

    }

    return 0;

}


// Faster C++ solution for the same problem (measured speedup: 2.4899001167836823x):
#include <bits/stdc++.h>

#include <set>

using namespace std;

#define mp             make_pair

#define pb             push_back

#define fi             first

#define se             second

#define sz(x)          (int)((x).size())

#define fill(x, y)     memset(x, y, sizeof(y))

#define all(x)         (x).begin(), (x).end()

typedef long long      ll;

typedef pair<int, int> ii;

typedef pair<ii, int>  iii;

typedef vector<int>    vi;

typedef vector<ii>     vii;

typedef vector<iii>    viii;



const ll INF = 1000000100;



int main() {

  ios::sync_with_stdio(false);

  cin.tie(0);

  ll N, W;

  cin >> N >> W;



  ll w[N+1];

  int v[N+1];



  int V = 0;

  for (int i = 1; i <= N; i++) {

    cin >> w[i] >> v[i];

    V += v[i];

  }



  ll dp[N+1][V+1];

  for (int i = 0; i <= V; i++) {

      dp[0][i] = INF;

  }

  for (int i = 0; i <= N; i++) {

      dp[i][0] = 0;

  }



  for (int i = 1; i <= N; i++) {

      for (int j = 1; j <= V; j++) {

          if (v[i] > j) {

              dp[i][j] = dp[i-1][j];

          } else {

              dp[i][j] = min(dp[i-1][j], dp[i-1][j-v[i]]+w[i]);

          }

      }

  }



  int opt = 0;

  for (int i = 0; i <= N; i++) {

      for (int j = 0; j <= V; j++) {

          if (dp[i][j] <= W) {

              opt = max(opt, j);

          }

      }

  }

  cout << opt << "\n";



  return 0;

}
// Slower C++ solution:
#include <cstdio>

#include <cstring>

#include <algorithm>

#include <iostream>





using namespace std;



const int MaxN = 1e5 + 5;



long long dp[MaxN];

long long w[105] , W , n;

long long v[MaxN];



int main(){

	memset(dp , 0x3f , sizeof dp);

	cin >> n >> W;

	for(int i = 1; i <= n ; i++){

		cin >> w[i] >> v[i];

	}

	dp[0] = 0;

	for(int i = 1; i <= n ; i++){

		for(int j = MaxN - 1 ; j >= v[i] ; j--){

			dp[j] = min(dp[j],dp[j - v[i]] + w[i]);

		}

	}

	for(int i = MaxN - 1 ; i >= 0 ; i--){

		if(dp[i] <= W){

			printf("%d\n",i);

			break;

		}

	}

	return 0;

}

// Faster C++ solution for the same problem (measured speedup: 2.4972757567749944x):
#include <bits/stdc++.h>

#include <set>

using namespace std;

#define mp             make_pair

#define pb             push_back

#define fi             first

#define se             second

#define sz(x)          (int)((x).size())

#define fill(x, y)     memset(x, y, sizeof(y))

#define all(x)         (x).begin(), (x).end()

typedef long long      ll;

typedef pair<int, int> ii;

typedef pair<ii, int>  iii;

typedef vector<int>    vi;

typedef vector<ii>     vii;

typedef vector<iii>    viii;



const ll INF = 1000000100;



int main() {

  ios::sync_with_stdio(false);

  cin.tie(0);

  ll N, W;

  cin >> N >> W;



  ll w[N+1];

  int v[N+1];



  int V = 0;

  for (int i = 1; i <= N; i++) {

    cin >> w[i] >> v[i];

    V += v[i];

  }



  ll dp[N+1][V+1];

  for (int i = 0; i <= V; i++) {

      dp[0][i] = INF;

  }

  for (int i = 0; i <= N; i++) {

      dp[i][0] = 0;

  }



  for (int i = 1; i <= N; i++) {

      for (int j = 1; j <= V; j++) {

          if (v[i] > j) {

              dp[i][j] = dp[i-1][j];

          } else {

              dp[i][j] = min(dp[i-1][j], dp[i-1][j-v[i]]+w[i]);

          }

      }

  }



  int opt = 0;

  for (int i = 0; i <= N; i++) {

      for (int j = 0; j <= V; j++) {

          if (dp[i][j] <= W) {

              opt = max(opt, j);

          }

      }

  }

  cout << opt << "\n";



  return 0;

}
// Slower C++ solution:
#include<bits/stdc++.h>



#define pb push_back

#define se second

#define fi first



using namespace std;



int n, c[(int)1e5 + 7], a[(int)1e5 + 7], w;

long long d[(int)2e5 + 7], mx;



int main(){

    ios_base::sync_with_stdio(0);

    cin.tie(0);

    cout.tie(0);

    cin >> n >> w;

    for(int i = 1; i <= n; i++)

        cin >> a[i] >> c[i];

    for(int i = 1e5 + 6; i > 0; i--)

        d[i] = 1e9 + 7;

    for(int i = 1; i <= n; i++)

    for(int j = 1e5 + 6; j >= 0; j--)

        if(d[j] != 1e9 + 7)

            d[j + c[i]] = min(d[j + c[i]], d[j] + a[i]);

    for(int j = 0; j <= 1e5 + 6; j++)

        if(d[j] <= w)

            mx = j;

    cout << mx;

}


// Faster C++ solution for the same problem (measured speedup: 2.6256491471201766x):
#include <bits/stdc++.h>

#include <set>

using namespace std;

#define mp             make_pair

#define pb             push_back

#define fi             first

#define se             second

#define sz(x)          (int)((x).size())

#define fill(x, y)     memset(x, y, sizeof(y))

#define all(x)         (x).begin(), (x).end()

typedef long long      ll;

typedef pair<int, int> ii;

typedef pair<ii, int>  iii;

typedef vector<int>    vi;

typedef vector<ii>     vii;

typedef vector<iii>    viii;



const ll INF = 1000000100;



int main() {

  ios::sync_with_stdio(false);

  cin.tie(0);

  ll N, W;

  cin >> N >> W;



  ll w[N+1];

  int v[N+1];



  int V = 0;

  for (int i = 1; i <= N; i++) {

    cin >> w[i] >> v[i];

    V += v[i];

  }



  ll dp[N+1][V+1];

  for (int i = 0; i <= V; i++) {

      dp[0][i] = INF;

  }

  for (int i = 0; i <= N; i++) {

      dp[i][0] = 0;

  }



  for (int i = 1; i <= N; i++) {

      for (int j = 1; j <= V; j++) {

          if (v[i] > j) {

              dp[i][j] = dp[i-1][j];

          } else {

              dp[i][j] = min(dp[i-1][j], dp[i-1][j-v[i]]+w[i]);

          }

      }

  }



  int opt = 0;

  for (int i = 0; i <= N; i++) {

      for (int j = 0; j <= V; j++) {

          if (dp[i][j] <= W) {

              opt = max(opt, j);

          }

      }

  }

  cout << opt << "\n";



  return 0;

}
// Slower C++ solution:
#include <bits/stdc++.h>

#define eps 1e-3

#define pi acos(-1.0)

#define inf 0x3f3f3f3f

#define debug1 cout<<"&&";

#define debug2 cout<<"**";

#define pb push_back

#define ms(a, x) memset(a, x, sizeof(a))

#define forn(i, n) for(int i = 0; i < n; ++i)

#define for1(i, n) for(int i = 1; i <= n; ++i) 

typedef double db;

typedef long long ll;

typedef unsigned long long ull;

using namespace std;

const int mod = 1e9;

const int N = 1e5 + 10;

/*=======================================================================*/



ll n, W, w[N], v[N], f[N];

ll ans = 0;

int main() {

  cin >> n >> W;

  ms(f, inf);

  f[0] = 0;

  for (int i = 1; i <= n; i++) cin >> w[i] >> v[i];



  for (int i = 1; i <= n; i++) {

     for (int l = 1e5; l >= v[i]; l--) {

        if (f[l - v[i]] + w[i] < f[l]) {

         //   debug1

            f[l] = f[l - v[i]] + w[i];

         }

         if(f[l] <= W) ans = max(ans, (ll)l);

     }

  }

  cout << ans << endl;

  return 0;

}

// Faster C++ solution for the same problem (measured speedup: 2.404278667969948x):
#include <bits/stdc++.h>

#include <set>

using namespace std;

#define mp             make_pair

#define pb             push_back

#define fi             first

#define se             second

#define sz(x)          (int)((x).size())

#define fill(x, y)     memset(x, y, sizeof(y))

#define all(x)         (x).begin(), (x).end()

typedef long long      ll;

typedef pair<int, int> ii;

typedef pair<ii, int>  iii;

typedef vector<int>    vi;

typedef vector<ii>     vii;

typedef vector<iii>    viii;



const ll INF = 1000000100;



int main() {

  ios::sync_with_stdio(false);

  cin.tie(0);

  ll N, W;

  cin >> N >> W;



  ll w[N+1];

  int v[N+1];



  int V = 0;

  for (int i = 1; i <= N; i++) {

    cin >> w[i] >> v[i];

    V += v[i];

  }



  ll dp[N+1][V+1];

  for (int i = 0; i <= V; i++) {

      dp[0][i] = INF;

  }

  for (int i = 0; i <= N; i++) {

      dp[i][0] = 0;

  }



  for (int i = 1; i <= N; i++) {

      for (int j = 1; j <= V; j++) {

          if (v[i] > j) {

              dp[i][j] = dp[i-1][j];

          } else {

              dp[i][j] = min(dp[i-1][j], dp[i-1][j-v[i]]+w[i]);

          }

      }

  }



  int opt = 0;

  for (int i = 0; i <= N; i++) {

      for (int j = 0; j <= V; j++) {

          if (dp[i][j] <= W) {

              opt = max(opt, j);

          }

      }

  }

  cout << opt << "\n";



  return 0;

}
// Slower C++ solution:
#include <iostream>

#include <cstdio>

#include <cstring>

#include <algorithm>

#define LL long long

using namespace std;

LL f[(int)1e5 + 10];

int main(){

    ios::sync_with_stdio(false);

    memset(f, 0x7f, sizeof(f));

    f[0] = 0;

    int n, W; cin>>n>>W;

    int maxl = 0, ans = 0;

    for(int i = 1; i <= n; i++){

        int wi, vi; cin>>wi>>vi;

        maxl += vi;

        for(int j = maxl; j >= vi; j--){

            f[j] = min(f[j], f[j - vi] + wi);

            if(f[j] <= W) ans = max(ans, j);

        }

    }

    cout<<ans;

    return 0;

}

// Faster C++ solution for the same problem (measured speedup: 1.781272251363876x):
#include <bits/stdc++.h>

#include <set>

using namespace std;

#define mp             make_pair

#define pb             push_back

#define fi             first

#define se             second

#define sz(x)          (int)((x).size())

#define fill(x, y)     memset(x, y, sizeof(y))

#define all(x)         (x).begin(), (x).end()

typedef long long      ll;

typedef pair<int, int> ii;

typedef pair<ii, int>  iii;

typedef vector<int>    vi;

typedef vector<ii>     vii;

typedef vector<iii>    viii;



const ll INF = 1000000100;



int main() {

  ios::sync_with_stdio(false);

  cin.tie(0);

  ll N, W;

  cin >> N >> W;



  ll w[N+1];

  int v[N+1];



  int V = 0;

  for (int i = 1; i <= N; i++) {

    cin >> w[i] >> v[i];

    V += v[i];

  }



  ll dp[N+1][V+1];

  for (int i = 0; i <= V; i++) {

      dp[0][i] = INF;

  }

  for (int i = 0; i <= N; i++) {

      dp[i][0] = 0;

  }



  for (int i = 1; i <= N; i++) {

      for (int j = 1; j <= V; j++) {

          if (v[i] > j) {

              dp[i][j] = dp[i-1][j];

          } else {

              dp[i][j] = min(dp[i-1][j], dp[i-1][j-v[i]]+w[i]);

          }

      }

  }



  int opt = 0;

  for (int i = 0; i <= N; i++) {

      for (int j = 0; j <= V; j++) {

          if (dp[i][j] <= W) {

              opt = max(opt, j);

          }

      }

  }

  cout << opt << "\n";



  return 0;

}
// Slower C++ solution:
#include <bits/stdc++.h>

using namespace std;

const int N = 1e5 + 10;

int dp[N];

int w[110];

int v[110];

int main()

{

	int n, sumw;

	scanf("%d%d", &n, &sumw);

	int sum = 0;

	for (int i = 1; i <= n; i++)

	{

		scanf("%d%d", &w[i], &v[i]);

		sum += v[i];

	}

	memset(dp, 0x3f3f3f3f, sizeof(dp));

	dp[0] = 0;

	for (int i = 1; i <= n; i++)

	{

		for (int j = sum; j >= v[i]; j--)

		{

			dp[j] = min(dp[j],dp[j - v[i]] + w[i]);

		}

	}

	for (int i = sum; i >= 0; i--)

	{

		if (dp[i] <= sumw)

		{

			printf("%d", i);

			return 0;

		}

	}

	return 0;

}

// Faster C++ solution for the same problem (measured speedup: 1.3628001424922325x):
#include <bits/stdc++.h>

#include <set>

using namespace std;

#define mp             make_pair

#define pb             push_back

#define fi             first

#define se             second

#define sz(x)          (int)((x).size())

#define fill(x, y)     memset(x, y, sizeof(y))

#define all(x)         (x).begin(), (x).end()

typedef long long      ll;

typedef pair<int, int> ii;

typedef pair<ii, int>  iii;

typedef vector<int>    vi;

typedef vector<ii>     vii;

typedef vector<iii>    viii;



const ll INF = 1000000100;



int main() {

  ios::sync_with_stdio(false);

  cin.tie(0);

  ll N, W;

  cin >> N >> W;



  ll w[N+1];

  int v[N+1];



  int V = 0;

  for (int i = 1; i <= N; i++) {

    cin >> w[i] >> v[i];

    V += v[i];

  }



  ll dp[N+1][V+1];

  for (int i = 0; i <= V; i++) {

      dp[0][i] = INF;

  }

  for (int i = 0; i <= N; i++) {

      dp[i][0] = 0;

  }



  for (int i = 1; i <= N; i++) {

      for (int j = 1; j <= V; j++) {

          if (v[i] > j) {

              dp[i][j] = dp[i-1][j];

          } else {

              dp[i][j] = min(dp[i-1][j], dp[i-1][j-v[i]]+w[i]);

          }

      }

  }



  int opt = 0;

  for (int i = 0; i <= N; i++) {

      for (int j = 0; j <= V; j++) {

          if (dp[i][j] <= W) {

              opt = max(opt, j);

          }

      }

  }

  cout << opt << "\n";



  return 0;

}
// Slower C++ solution:
#include<bits/stdc++.h>

typedef long long ll;

using namespace std;

const ll N=200010,INF=1e14;

int main(){

	ios_base::sync_with_stdio(0); cout.tie(0); cin.tie(0);

	ll n,i,j,dp[N],cap,t,val=0,a[N],b[N],best;

	cin>>n>>cap;

	for(i=0;i<n;++i){

		cin>>a[i]>>b[i];

		val+=b[i];

	}

	for(i=1;i<=val;++i) dp[i]=INF;

	dp[0]=0;

	for(i=0;i<n;++i){

		for(j=val;j>=b[i];--j){

			dp[j]=min(dp[j-b[i]]+a[i],dp[j]);

		}

	}

	for(i =val;i>=0;i--){

		if(dp[i] <= cap){

			cout << i << endl;

			break;

		}

	}

	return 0;

}

// Faster C++ solution for the same problem (measured speedup: 1.0989861091260804x):
#include <bits/stdc++.h>

#include <set>

using namespace std;

#define mp             make_pair

#define pb             push_back

#define fi             first

#define se             second

#define sz(x)          (int)((x).size())

#define fill(x, y)     memset(x, y, sizeof(y))

#define all(x)         (x).begin(), (x).end()

typedef long long      ll;

typedef pair<int, int> ii;

typedef pair<ii, int>  iii;

typedef vector<int>    vi;

typedef vector<ii>     vii;

typedef vector<iii>    viii;



const ll INF = 1000000100;



int main() {

  ios::sync_with_stdio(false);

  cin.tie(0);

  ll N, W;

  cin >> N >> W;



  ll w[N+1];

  int v[N+1];



  int V = 0;

  for (int i = 1; i <= N; i++) {

    cin >> w[i] >> v[i];

    V += v[i];

  }



  ll dp[N+1][V+1];

  for (int i = 0; i <= V; i++) {

      dp[0][i] = INF;

  }

  for (int i = 0; i <= N; i++) {

      dp[i][0] = 0;

  }



  for (int i = 1; i <= N; i++) {

      for (int j = 1; j <= V; j++) {

          if (v[i] > j) {

              dp[i][j] = dp[i-1][j];

          } else {

              dp[i][j] = min(dp[i-1][j], dp[i-1][j-v[i]]+w[i]);

          }

      }

  }



  int opt = 0;

  for (int i = 0; i <= N; i++) {

      for (int j = 0; j <= V; j++) {

          if (dp[i][j] <= W) {

              opt = max(opt, j);

          }

      }

  }

  cout << opt << "\n";



  return 0;

}
// Slower C++ solution:
#include <cstdio>

#include <algorithm>

#include <vector>

using namespace std;

 

long long n,dp[100005],w,v,k,mxw,ans,pt,lpt;

bool d[100005];

int main(){

	scanf("%lld%lld",&n,&mxw);

	for (int i=100000;i>=1;i--){

		dp[i]=1e9+1;

	}

	d[0]=true; dp[0]=0;

	for (int i=1;i<=n;i++){

		scanf("%lld%lld",&w,&v); 

		for (int j=100000;j>=0;j--){

			if (d[j] == true && j+v <= 100000 && dp[j]+w <= mxw){

				d[j+v]=true;

				dp[j+v]=min(dp[j+v],dp[j]+w);

			}

		}

	}

	for (int i=0;i<=100000;i++){

		if	(d[i])

		ans=i;

	}

	printf("%lld\n",ans);

	return 0;

} 

// Faster C++ solution for the same problem (measured speedup: 1.5750975381017631x):
#include <bits/stdc++.h>

#include <set>

using namespace std;

#define mp             make_pair

#define pb             push_back

#define fi             first

#define se             second

#define sz(x)          (int)((x).size())

#define fill(x, y)     memset(x, y, sizeof(y))

#define all(x)         (x).begin(), (x).end()

typedef long long      ll;

typedef pair<int, int> ii;

typedef pair<ii, int>  iii;

typedef vector<int>    vi;

typedef vector<ii>     vii;

typedef vector<iii>    viii;



const ll INF = 1000000100;



int main() {

  ios::sync_with_stdio(false);

  cin.tie(0);

  ll N, W;

  cin >> N >> W;



  ll w[N+1];

  int v[N+1];



  int V = 0;

  for (int i = 1; i <= N; i++) {

    cin >> w[i] >> v[i];

    V += v[i];

  }



  ll dp[N+1][V+1];

  for (int i = 0; i <= V; i++) {

      dp[0][i] = INF;

  }

  for (int i = 0; i <= N; i++) {

      dp[i][0] = 0;

  }



  for (int i = 1; i <= N; i++) {

      for (int j = 1; j <= V; j++) {

          if (v[i] > j) {

              dp[i][j] = dp[i-1][j];

          } else {

              dp[i][j] = min(dp[i-1][j], dp[i-1][j-v[i]]+w[i]);

          }

      }

  }



  int opt = 0;

  for (int i = 0; i <= N; i++) {

      for (int j = 0; j <= V; j++) {

          if (dp[i][j] <= W) {

              opt = max(opt, j);

          }

      }

  }

  cout << opt << "\n";



  return 0;

}
// Slower C++ solution:
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;

typedef unsigned long long ull;

#define     FasterIO        ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);

#define     bug(a,b)        cout<<a<<"\t"<<b<<"\n";

#define     Case(a,b)       cout<<"Case "<<a<<": "<<b<<"\n";

#define     watch(a)        cout<<fixed<<setprecision(a)

#define     lp(i,a,b)       for(int i=a;i<b;i++)

#define     Endl            "\n";

#define     tab             "\t"

#define     reset(a,b)      memset(a,b,sizeof(a));

#define     sfl(a)          scanf(" %lld", &a);

#define     sf(a)           scanf(" %d", &a);

#define     srt(a)          sort(a.begin(),a.end());

#define     pi              2*acos(0.0)

const int sz=1e5+9;

const ll inf=1e18L+9;

ll dp[sz];





void solve(){

    reset(dp,inf);

    int n,w;

    sf(n);

    sf(w);

    vector<pair<ll,int>>v(n);

    dp[0]=0;

    int pnt=0;

    lp(i,0,n){

       sfl(v[i].first);

       sf(v[i].second);

       pnt+=v[i].second;

    }

    //bug(pnt, 1);

   // sort(v.begin(),v.end(),com);

    for(int i=0;i<n;i++){



        for(int j=pnt-v[i].second;j>=0;j--){

            dp[j+v[i].second]=min( dp[j+v[i].second],dp[j]+v[i].first);

        }



    }

   // bug("140 dp",dp[140]);

    for(int i=pnt;i>=0;i--){

        if(dp[i]<=w){

            printf("%d\n",i);

            return;

        }

    }

}



int main(){

    //FasterIO;

    #ifndef ONLINE_JUDGE

    //    freopen("1.txt","r",stdin);

    #endif

    //int t;

//cin>>t;

   // while(t--)

        solve();

}

// Faster C++ solution for the same problem (measured speedup: 1.767232877929629x):
#include <bits/stdc++.h>

#include <set>

using namespace std;

#define mp             make_pair

#define pb             push_back

#define fi             first

#define se             second

#define sz(x)          (int)((x).size())

#define fill(x, y)     memset(x, y, sizeof(y))

#define all(x)         (x).begin(), (x).end()

typedef long long      ll;

typedef pair<int, int> ii;

typedef pair<ii, int>  iii;

typedef vector<int>    vi;

typedef vector<ii>     vii;

typedef vector<iii>    viii;



const ll INF = 1000000100;



int main() {

  ios::sync_with_stdio(false);

  cin.tie(0);

  ll N, W;

  cin >> N >> W;



  ll w[N+1];

  int v[N+1];



  int V = 0;

  for (int i = 1; i <= N; i++) {

    cin >> w[i] >> v[i];

    V += v[i];

  }



  ll dp[N+1][V+1];

  for (int i = 0; i <= V; i++) {

      dp[0][i] = INF;

  }

  for (int i = 0; i <= N; i++) {

      dp[i][0] = 0;

  }



  for (int i = 1; i <= N; i++) {

      for (int j = 1; j <= V; j++) {

          if (v[i] > j) {

              dp[i][j] = dp[i-1][j];

          } else {

              dp[i][j] = min(dp[i-1][j], dp[i-1][j-v[i]]+w[i]);

          }

      }

  }



  int opt = 0;

  for (int i = 0; i <= N; i++) {

      for (int j = 0; j <= V; j++) {

          if (dp[i][j] <= W) {

              opt = max(opt, j);

          }

      }

  }

  cout << opt << "\n";



  return 0;

}