Cod sursa(job #672690)
Utilizator | Data | 2 februarie 2012 22:09:19 | |
---|---|---|---|
Problema | Problema rucsacului | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.3 kb |
#include <fstream>
using namespace std;
ifstream f ("rucsac.in");
ofstream g ("rucsac.out");
int v[10005];
int main()
{
int n,G,Wi,Pi;
f>>n>>G;
for (;n>0;n--)
{
f>>Wi>>Pi;
for (int i=G-Wi; i>=0; i--)
if (v[Wi+i]<v[i]+Pi)
v[Wi+i]=v[i]+Pi;
}
g<<v[G];
return 0;
}