Cod sursa(job #2788185)
Utilizator | Data | 25 octombrie 2021 11:27:19 | |
---|---|---|---|
Problema | Problema rucsacului | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.38 kb |
#include <bits/stdc++.h>
#define nmax 5005
using namespace std;
string prob="rucsac";
ifstream in(prob+".in");
ofstream out(prob+".out");
int d[2*nmax],w[nmax],p[nmax];
int main(){
int n,g;
in>>n>>g;
for(int i=1;i<=n;i++){
in>>w[i]>>p[i];
for(int j=g;j>=w[i];j--){
d[j]=max(d[j],d[j-w[i]]+p[i]);
}
}
out<<d[g];
}