蒟蒻救助，蜜汁RE

#include <bits/stdc++.h>
#define INF 1e9
using namespace std;
long long n,m,ans=INF,w[50005],c[50005],f[50005];

int main(){
    cin>>n>>m;
    for(long long i=1;i<=m+5000;++i)
        f[i]=INF;
    for(long long i=1;i<=n;i++)
       cin>>c[i]>>w[i];
    for(long long i=1;i<=n;i++)
       for(long long j=c[i];j<=m+5000;j++)
          f[j]=min(f[j],f[j-c[i]]+w[i]);
    for(long long i=m;i<=m+5000;i++)
       ans=min(ans,f[i]);
    cout<<ans<<endl;
    return 0;
}