Mai intai trebuie sa te autentifici.
Cod sursa(job #1222788)
| Utilizator | Data | 24 august 2014 13:30:13 | |
|---|---|---|---|
| Problema | Problema rucsacului | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.47 kb |
#include <fstream>
using namespace std;
int N, G, P[1000000], g[10002], p[10002];
int main()
{
ifstream mama("rucsac.in");
ofstream tata("rucsac.out");
int i;
mama>>N>>G;
for(i=1; i<=N; i++)
mama>>g[i]>>p[i];
int j;
for(i=1; i<=N; i++){
j=G;
while(j>=g[i]){
if(P[j-g[i]] + p[i] > P[j]) P[j] = P[j-g[i]] + p[i];
j--;
}
}
tata<<P[G];
return 0;
}
