Cod sursa(job #1668514)
Utilizator | Data | 29 martie 2016 20:41:11 | |
---|---|---|---|
Problema | Problema rucsacului | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.46 kb |
#include <fstream>
using namespace std;
ifstream f("rucsac.in");
ofstream g("rucsac.out");
int n,gr,x,y,i,j,ma,b[10001];
int main()
{ f>>n>>gr;
f>>x>>y;
b[x]=y;
for (i=2;i<=n;++i) {
f>>x>>y;
for (j=gr-x;j>=0;--j) {
if (b[j]>0)
if (b[j+x]==0 || b[j+x]<b[j]+y)
b[j+x]=b[j]+y;}}
for (i=1;i<=gr;++i)
if (b[i]>ma)
ma=b[i];
g<<ma<<'\n';
return 0;
}