Cod sursa(job #2507441)
Utilizator | Data | 10 decembrie 2019 11:53:33 | |
---|---|---|---|
Problema | Energii | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 0.47 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin (".in");
ofstream fout (".out");
int v[10002];
int main () {
int g, w;
fin >> g >> w;
for (int i = 1; i <= g; i++) {
int c, e;
fin >> e >> c;
for (int j = 10002; j >= c; j--)
v[j] = max(e, v[j - c] + e);
}
for (int i = 1; i <= 10002; i++) {
if (v[i] >= w) {
fout << i;
break;
}
}
}