Cod sursa(job #2629652)
Utilizator | Data | 22 iunie 2020 09:25:59 | |
---|---|---|---|
Problema | Problema rucsacului | Scor | 65 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.44 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream f("rucsac.in");
ofstream gg("rucsac.out");
const int N=5010;
int n,G,val,g,d[N],best;
int main()
{
f>>n>>G;
d[0]=0;
for(int i=1;i<=n;i++)
{
f>>g>>val;
for(int j=G-g;j>=0;j--)
{
d[j+g]=max(d[j+g],d[j]+val);
best=max(best,d[j+g]);
}
}
gg<<best;
return 0;
}