Cod sursa(job #1819825)
Utilizator | Data | 30 noiembrie 2016 21:00:35 | |
---|---|---|---|
Problema | Arbore partial de cost minim | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.4 kb |
#include <fstream>
#include <vector>
#include <algorithm>
using namespace std;
int main()
{
ifstream fin("rucsac.in");
ofstream fout("rucsac.out");
int n,g;
fin>>n>>g;
vector<int> dp(g+1,0);
for(int i=0;i<n;++i){
int w, p;
fin>>w>>p;
for(int j=g; j>=w; --j){
dp[j]=max(dp[j],dp[j-w]+p);
}
}
fout<<dp[g]<<'\n';
return 0;
}