玄关0pts

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
ll f[250009];
int a[509],c[509];
int main()
{
    int n,k;
    cin>>n>>k;
    int sum_val=0;
    for(int i=1;i<=n;i++)cin>>a[i]>>c[i],sum_val+=a[i];
    memset(f,0x3f,sizeof f);
    f[0]=0;
    for(int i=1;i<=n;i++)
    {
        for(int j=sum_val;j>=0;j--)
        {
            if(j>=a[i]&&f[j-a[i]]!=0x3f3f3f3f3f3f3f3f)f[j]=f[j-a[i]]+c[i];
        }
    }
    for(int i=sum_val;i>=0;i--)
    {
        if(f[i]<=k){cout<<i;return 0;}
    }
}