Cod sursa(job #1941419)
| Utilizator | Data | 27 martie 2017 11:51:00 | |
|---|---|---|---|
| Problema | Problema rucsacului | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.29 kb |
#include<fstream>
using namespace std;
ifstream fin("rucsac.in");
ofstream fout("rucsac.out");
int a[10003];
int main()
{int j,G,n,i,profit,g,k=0;
fin>>n>>G;
for(i=1;i<=n;i++)
{fin>>g>>profit;
for(j=G;j>=g;j--)
if(a[j]<a[j-g]+profit)
a[j]=a[j-g]+profit;
}
fout<<a[G];
}
