1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
#include <fstream>
#include <algorithm>
#define nmax 5000+5
#define gmax 10000+5
using namespace std;

ifstream fin("rucsac.in");
ofstream fout("rucsac.out");

int N;
int G;
int W[nmax];
int P[nmax];
int C[gmax];
int indxmax;

void citire()
{
    fin >> N >> G;
    for (int i = 1; i <= N; i++)
        fin >> W[i] >> P[i];
}

void rezolvare()
{
    C[0] = 0;
    for (int i = 1; i <= G; i++)
        C[i] = -1;
    for (int i = 1; i <= N; i++)
    {
        for (int j = G - W[i]; j >= 0; j--)
            if (C[j] != -1)
            {
                C[j+W[i]] = max(C[j+W[i]],C[j]+P[i]);
                if (C[j+W[i]] > C[indxmax])
                    indxmax = j+W[i];
            }
    }
}

void afisare()
{
    fout << C[indxmax] << '\n';
}
int main()
{
    citire();
    rezolvare();
    afisare();
    return 0;
}