Pagini recente » Cod sursa (job #3161282) | Cod sursa (job #293914) | Cod sursa (job #1315065) | Cod sursa (job #2328128) | Cod sursa (job #1468844)
#include <cstdio>
#include <cstdlib>
#include <cassert>
#include <vector>
#include <queue>
#include <cstring>
#include <set>
#include <cctype>
using namespace std;
#ifdef INFOARENA
#define ProblemName "rucsac"
#endif
#define MCONCAT(A, B) A B
#ifdef ProblemName
#define InFile MCONCAT(ProblemName, ".in")
#define OuFile MCONCAT(ProblemName, ".out")
#else
#define InFile "fis.in"
#define OuFile "fis.out"
#endif
template <class T> void readNum(T &nr) {
nr = 0;
T sign = 1;
char c;
while (!isdigit(c = getchar()))
(c == '-') && (sign = -1);
do {
nr = nr * 10 + c - '0';
} while (isdigit(c = getchar()));
nr *= sign;
}
#define MAXN 5010
#define MAXG 10010
int W[MAXN], P[MAXN], v[MAXG];
int main() {
assert(freopen(InFile, "r", stdin));
assert(freopen(OuFile, "w", stdout));
int N, G;
readNum(N); readNum(G);
//vector<int> W(N), P(N);
for (int i = 0; i < N; i++) {
readNum(W[i]); readNum(P[i]);
}
//vector<int> v(G + 1, 0);
int sol = 0;
//fprintf(stderr, "Frec menta\n");
for (int j = 0; j < N; j++) {
for (int i = G; i >= W[j]; i--) {
v[i] = max(v[i], v[i - W[j]] + P[j]);
if (v[i] > sol)
sol = v[i];
}
}
printf("%d\n", sol);
return 0;
}