knapsack

#include <bits/stdc++.h>
#define int long long
#define pb push_back
using namespace std;
const int N = 600;
int n, W, c[N], w[N];
int dp[N][25020];
main()
{
	cin >> n >> W;
	int sc=  0;
	int mx = 0;
	for(int i = 0; i < n; i++)
	{
		cin >> w[i + 1] >> c[i + 1];
		mx = max(mx, c[i + 1]);
		sc += c[i + 1];
	}

	dp[0][0] = 0;
	for(int i = 1; i < 25020; i++)
	{
		dp[0][i] = W + 1;
	}

	for(int i = 1; i <= n; i++)
	{
		for(int j = 0; j <= sc; j++)
		{
			if(j - c[i] < 0)
			{
				dp[i][j] = dp[i - 1][j];
				continue;
			}
			dp[i][j] = min(dp[i - 1][j], dp[i - 1][j - c[i]] + w[i]);
		}
 	}
 	int ans = 0;
 	for(int i = 0; i <= sc; i++)
 	{
 		if(dp[n][i] <= W) ans = max(ans, i);
 	}
 	cout << ans;
}