Cod sursa(job #825350)
| Utilizator |  Neculaescu Theodor sleepaholic |
Data | 28 noiembrie 2012 20:08:57 |
|---|---|---|---|
| Problema | Problema rucsacului | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.3 kb |
#include<fstream>
using namespace std;
int N,G,a[10100];
int i,j,w,p;
int main()
{
ofstream g("rucsac.out");
ifstream f("rucsac.in");
f>>N>>G;
for(i=0;i<N;i++)
{
f>>w>>p;
for(j=G-w;j>=0;j--)
{
if(a[j]+p>a[j+w])
a[j+w]=a[j]+p;
}
}
g<<a[G];
return 0;
}
