Cod sursa(job #1386081)
Utilizator | Data | 12 martie 2015 17:59:49 | |
---|---|---|---|
Problema | Problema rucsacului | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.45 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin("rucsac.in");
ofstream fout("rucsac.out");
int n,k,v[10001],g,p,i,j,maxi;
vector <int> poz;
int main()
{
fin>>n>>maxi;
for(i=1;i<=n;i++)
{
fin>>g>>p;
for(j=maxi-g;j>0;j--)
if(v[j])
v[j+g]=max(v[j+g],v[j]+p);
v[g]=max(v[g],p);
}j=0;
for(i=1;i<=maxi;i++)
j=max(j,v[i]);
fout<<j;
return 0;
}