Pagini recente » Cod sursa (job #2640980) | Istoria paginii runda/ret1/clasament | Cod sursa (job #2462314) | Monitorul de evaluare | Cod sursa (job #2201598)
#include <stdio.h>
#include <algorithm>
#define MAXN 5010
#define MAXG 10010
int N, G, Pmax;
int W[MAXN], P[MAXN];
int D[2][MAXG];
int main(){
freopen("energii.in", "r", stdin);
freopen("energii.out", "w", stdout);
scanf("%d%d", &N, &G);
for(int i = 1; i <= N; ++i)
scanf("%d%d", &W[i], &P[i]);
int l=0;
for(int i = 1; i <= N; ++i, l = 1 - l)
for(int cw = G; cw <= 10001; ++cw){
D[1-l][cw] = D[l][cw];
if(W[i] <= cw)
D[1-l][cw] = std::max(D[1-l][cw], D[l][cw - W[i]] + P[i]);
}
Pmax = D[l][G];
printf("%d", Pmax);
return 0;
}