Cod sursa(job #2718286)
Utilizator | Data | 8 martie 2021 17:18:31 | |
---|---|---|---|
Problema | Problema rucsacului | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | no-time-to-rest | Marime | 0.37 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream f("rucsac.in");
ofstream g("rucsac.out");
int n,G,rucsac[10005];
int main()
{
f>>n>>G;
for(int i=1;i<=n;i++)
{
int x,y;
f>>y>>x;
for(int j=G-y;j>=0;j--)
rucsac[j+y]=max(rucsac[j+y],rucsac[j]+x);
}
int maxim=0;
for(int i=1;i<=G;i++) maxim=max(maxim,rucsac[i]);
g<<maxim;
}