南阳860

/*
d[v] = w; ->价值为v时,d[v] = 达到该价值的最小重量
*/
#include<iostream>
#include<cstring>
using namespace std;

int d[10005];
int maxd,n,maxw,w,v;

void bag(int w,int v)
{
    if(w > maxw)
        return ;
    for(int i=10000; i>v; --i)
    {
        if( (d[i-v]>0 && d[i-v]+w < d[i]) || (d[i] == 0 && d[i-v]!=0 && d[i-v]+w <= maxw) )
        {
            d[i] = d[i-v]+w;
            if(i > maxd)
                maxd = i;
        }
    }
    if(d[v] > w || d[v] == 0)
    {
        d[v] = w;
        if(v > maxd)
            maxd = v;
    }
}

int main()
{
    while(cin >> n >> maxw)
    {
        memset(d,0,sizeof d);
        maxd = 0;
        while(n--)
        {
            cin >> w >> v;
            bag(w,v);
        }
        cout << maxd << endl;
    }
    return 0;
}


//最优代码
 
#include <cstdio>
#include <cstring>
#include <string>
#include <queue>
#include <algorithm>
#include <vector>
#include <cmath>
#include <iostream>
#include <ctime>
using namespace std;

const int N = 1e2+10;
const int inf = 1<<30;
int n, W, sumV;
int w[N], v[N];
int dp[N][N*N];
void solve()
{
    int i, j;
    for(j = 1;j <= sumV;j++)
        dp[0][j] = inf;
    dp[0][0] = 0;
    for(i = 1;i <= n;i++)
    {
        for(j = 0;j <= sumV;j++)
        {
            if(j < v[i])
                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 res = 0;
    for(i = 0;i <= sumV;i++)
        if(dp[n][i] <= W)
            res = i;
    printf("%d
", res);
}
int main()
{
    //freopen("Input.txt","r",stdin);
    //freopen("Output.txt","w",stdout);
    int i, j;
    while(~scanf("%d%d", &n, &W))
    {
        sumV = 0;
        for(i = 1;i <= n;i++)
            scanf("%d%d", &w[i], &v[i]), sumV += v[i];
        solve();
    }
}