Cod sursa(job #3038470)
Utilizator | Data | 27 martie 2023 13:49:45 | |
---|---|---|---|
Problema | Problema rucsacului | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.46 kb |
#include <fstream>
using namespace std;
ifstream cin("rucsac.in");
ofstream cout("rucsac.out");
int i, j, n, m, g, G, maxx;
int v[5002], d[10002], p[5002];
int main() {
cin>>n>>G;
for(i=1;i<=n;i++)
cin>>v[i]>>p[i];
for(i=1;i<=n;i++){
for(j=G-v[i];j>=0;j--){
if(d[j+v[i]]<d[j]+p[i])
d[j+v[i]]=d[j]+p[i];
}
}
for(i=1;i<=G;i++){
maxx=max(maxx, d[i]);
}
cout<<maxx;
}