Cod sursa(job #2397369)
Utilizator | Data | 4 aprilie 2019 12:41:18 | |
---|---|---|---|
Problema | Problema rucsacului | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.42 kb |
#include<bits/stdc++.h>
using namespace std;
int d[10005],t[10005],maxc;
int main(){
ifstream fin("rucsac.in");
ofstream fout("rucsac.out");
int n,g,w,p;
fin>>n>>g;
for(int i=0;i<n;i++){
fin>>w>>p;
for(int j=g-w;j>=0;j--){
if(d[j]+p>d[j+w]){
d[j+w]=d[j]+p;
}
if(maxc<d[j+w]){
maxc=d[j+w];
}
}
}
fout<<maxc;
return 0;
}