Cod sursa(job #984001)
Utilizator | Data | 13 august 2013 10:52:59 | |
---|---|---|---|
Problema | Problema rucsacului | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.41 kb |
#include <fstream>
#include <algorithm>
using namespace std;
ifstream f("rucsac.in");
ofstream g("rucsac.out");
int main()
{
int n,G;
int v[10001]={};
f>>n>>G;
v[0]=1;
for(int i=1;i<=n;i++){
int w,p;
f>>w>>p;
for(int j=G-w;j>=0;j--)
if(v[j]&&v[j]+p>v[j+w])
v[j+w]=v[j]+p;
}
g<<*max_element(v,v+G+1)-1;
return 0;
}