Cod sursa(job #1866532)
Utilizator | Data | 3 februarie 2017 11:38:26 | |
---|---|---|---|
Problema | Problema rucsacului | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.41 kb |
//#include <iostream>
#include <fstream>
using namespace std;
ifstream cin("rucsac.in");
ofstream cout("rucsac.out");
int w[10101], j;
int main()
{
int n, Gmax, g, val, i, ii;
cin >> n >> Gmax;
for(ii=1; ii<=n; ii++)
{
cin >> g >> val;
for(j=Gmax-g; j>=0; j--)
if(w[j+g]<w[j]+val)
w[j+g]=w[j]+val;
}
cout << w[Gmax];
return 0;
}