Cod sursa(job #920430)
Utilizator | Ionescu Teodor teoionescu | Data | 20 martie 2013 13:15:00 |
---|---|---|---|
Problema | Problema rucsacului | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.57 kb |
#include<fstream>
#define N 5001
#define G 10001
using namespace std;
ifstream in("rucsac.in");
ofstream out("rucsac.out");
int i,j,n,k,p[N],g[N],profit[G],ma=0;
int main(){
in>>n>>k;
for(i=1;i<=n;i++) in>>g[i]>>p[i];
for(i=1;i<=n;i++){
for(j=k-g[i];j>0;j--){
if(profit[j]!=0 && profit[j]+p[i]>profit[j+g[i]])
profit[j+g[i]]=profit[j]+p[i];
}
if(g[i]<=k && p[i]>profit[g[i]])
profit[g[i]]=p[i];
}
for(i=1;i<=k;i++) if(profit[i]>ma) ma=profit[i];
out<<ma;
return 0;
}