bzoj1625 [Usaco2007 Dec]宝石手镯

01背包

 #include<algorithm>
 #include<iostream>
 #include<cstdlib>
 #include<cstring>
 #include<cstdio>
 #include<string>
 #include<cmath>
 #include<ctime>
 #include<queue>
 #include<stack>
 #include<map>
 #include<set>
 #define rre(i,r,l) for(int i=(r);i>=(l);i--)
 #define re(i,l,r) for(int i=(l);i<=(r);i++)
 #define Clear(a,b) memset(a,b,sizeof(a))
 #define inout(x) printf("%d",(x))
 #define douin(x) scanf("%lf",&x)
 #define strin(x) scanf("%s",(x))
 #define LLin(x) scanf("%lld",&x)
 #define op operator
 #define CSC main
 typedef unsigned long long ULL;
 typedef const int cint;
 typedef long long LL;
 using namespace std;
 void inin(int &ret)
 {
     ret=;int f=;char ch=getchar();
     while(ch<''||ch>''){if(ch=='-')f=;ch=getchar();}
     while(ch>=''&&ch<='')ret*=,ret+=ch-'',ch=getchar();
     ret=f?-ret:ret;
 }
 int n,c,w[],v[],hh[];
 int main()
 {
     inin(n),inin(c);
     re(i,,n)inin(v[i]),inin(w[i]);
     re(i,,n)rre(j,c,v[i])hh[j]=max(hh[j],hh[j-v[i]]+w[i]);
     int ans=;
     re(i,,c)ans=max(ans,hh[i]);
     cout<<ans;
      return ;
 }