Cod sursa(job #1522282)
Utilizator | Data | 11 noiembrie 2015 15:20:12 | |
---|---|---|---|
Problema | Problema rucsacului | Scor | 25 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.56 kb |
#include<fstream>
#include<algorithm>
using namespace std;
ifstream fin("rucsac.in");
ofstream fout("rucsac.out");
unsigned n,G,v[5005],g[5005],x1[10005],x2[10005];
int main(){
fin>>n>>G;
for(int i=0;i<n;++i){
fin>>g[i]>>v[i];
}
for(int i=1;i<=n;++i){
for(int j=1;j<=G;++j){
x2[j]=x1[j];
if(j>g[i]){
x2[j]=max(x1[j],x1[j-g[i]]+v[i]);
}
}
for(int j=1;j<=G;++j){
x1[j]=x2[j];
}
}
fout<<x1[G];
}