Cod sursa(job #3252369)
Utilizator | Data | 29 octombrie 2024 14:14:12 | |
---|---|---|---|
Problema | Problema rucsacului | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.39 kb |
#include<bits/stdc++.h>
using namespace std;
ifstream fin("rucsac.in");
ofstream fout("rucsac.out");
int n,i,j,gmax,p[10001],maxim,g,x;
int main(){
fin>>n>>gmax;
for(i=1;i<=n;i++){
fin>>g>>x;
for(j=gmax;j>=g;j--){
p[j] = max(p[j], p[j-g]+x);
}
}
for(i=1;i<=gmax;i++)
maxim = max(maxim, p[i]);
fout<<maxim;
return 0;
}