Cod sursa(job #1279956)
Utilizator | Data | 1 decembrie 2014 10:12:31 | |
---|---|---|---|
Problema | Problema rucsacului | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.36 kb |
#include <fstream>
#include<algorithm>
using namespace std;
ifstream fi("rucsac.in");
ofstream fo("rucsac.out");
int n,m,x[5002],y[5002],v[10002];
int main() {
fi>>n>>m;
for(int i=1;i<=n;i++)
fi>>x[i]>>y[i];
for(int i=1;i<=n;i++)
for(int j=m;j>=x[i];j--)
v[j]=max(v[j],v[j-x[i]]+y[i]);
fo<<v[m];
return 0;
}