Cod sursa(job #2043479)
| Utilizator | Data | 20 octombrie 2017 09:16:36 | |
|---|---|---|---|
| Problema | Problema rucsacului | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.49 kb |
#include <bits/stdc++.h>
#define DIM 10001
using namespace std;
ifstream f("rucsac.in");
ofstream g("rucsac.out");
int n, G;
int C[DIM], gr, c;
void solve()
{
f>>n>>G;
for (int i=1; i<=n; i++)
{
f>>gr>>c;
for (int j=G; j>=gr; j--)
if (C[j]<C[j-gr]+c)
C[j]=C[j-gr]+c;
}
g<<C[G]<<'\n';
f.close();
g.close();
}
int main()
{
solve();
g.close();
return 0;
}
