Cod sursa(job #2272840)
Utilizator | Data | 30 octombrie 2018 18:36:16 | |
---|---|---|---|
Problema | Problema rucsacului | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.41 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream f("rucsac.in");
ofstream g("rucsac.out");
int n,W,w,st,dr,p,P[10010];
int main()
{
f>>n>>W;
fill(P+1,P+W+1,-1000000000);
for(;n;n--)
{
f>>w>>p;
for(dr=W,st=W-w;st>=0;dr--,st--)
P[dr]=max(P[dr],P[st]+p);
}
p=0;
for(int i=0;i<=W;i++)
p=max(p,P[i]);
g<<p;
return 0;
}