Cod sursa(job #1786039)
| Utilizator | Data | 22 octombrie 2016 11:46:49 | |
|---|---|---|---|
| Problema | Problema rucsacului | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.39 kb |
#include <iostream>
#include <fstream>
using namespace std;
int a[10005],N,G;
void work()
{
ifstream fin("rucsac.in");
fin>>N>>G;
for(int i=1;i<=N;i++)
{
int g,v;
fin>>g>>v;
for(int j=G;j>=g;j--)
a[j]=max(a[j],a[j-g]+v);
}
}
int main()
{
work();
ofstream fout("rucsac.out");
fout<<a[G];
return 0;
}
