Cod sursa(job #1222786)
Utilizator | Data | 24 august 2014 13:26:31 | |
---|---|---|---|
Problema | Problema rucsacului | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.4 kb |
#include <iostream>
using namespace std;
int N, G, P[1000000], g[100], p[100];
int main()
{
int i;
cin>>N>>G;
for(i=1; i<=N; i++)
cin>>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--;
}
}
cout<<P[G];
return 0;
}