Pagini recente » Cod sursa (job #2058350) | Cod sursa (job #1073836) | Cod sursa (job #2954892) | Cod sursa (job #2074451) | Cod sursa (job #1165988)
#include<fstream>
#include<cstdio>
#include<set>
#include<stack>
#include<vector>
#include<algorithm>
#define FOR(a,b,c) for(int a=b;a<=c;++a)
#include<cstring>
#include<bitset>
#include<cmath>
#include<iomanip>
#include<queue>
#define f cin
#define g cout
#define mp make_pair
#define pb push_back
#define fi first
#define se second
#define ll long long
#define inf (1<<30)
#define base 256
#define ba 255
#define N 10100
#define EPS 1e-12
#define mod 666013
#define inu "rucsac.in"
#define outu "rucsac.out"
using namespace std;
ifstream f(inu);
ofstream g(outu);
//int dx[]={0,0,0,1,-1};
//int dy[]={0,1,-1,0,0};
int ma,w,c,n,G,D[N];
int main ()
{
f>>n>>G;
FOR(i,1,G)
D[i]=-1;
FOR(i,1,n)
{
f>>w>>c;
for(int j=G-w;j>=0;j--)
{
if(D[j]==-1)
continue;
if(D[j]+c>D[j+w])
D[j+w]=D[j]+c;
}
}
FOR(i,1,G)
if(D[i]!=inf)
ma=max(ma,D[i]);
g<<ma;
return 0;
}