bzoj1625 / P2871 [USACO07DEC]手链Charm Bracelet

 1 #include<iostream>
 2 #include<cstdio>
 3 #include<cstring>
 4 #define re register
 5 using namespace std;
 6 int max(int a,int b){return a>b?a:b;}
 7 int n,m,f[12885],a,b;
 8 int main(){
 9     scanf("%d%d",&n,&m);
10     for(re int i=1;i<=n;++i){
11         scanf("%d%d",&a,&b);
12         for(re int j=m;j>=a;--j)
13             f[j]=max(f[j],f[j-a]+b);
14     }printf("%d",f[m]);
15     return 0;
16 }