hiho Week 7 register

Ended

Participants:913

Verdict:Accepted
Score:100 / 100
Submitted:2014-08-20 17:27:12

Lang:G++

Edit
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
#include <bits/stdc++.h>
int main()
{
    int m, n, nneed, nval;
    scanf("%d%d", &n, &m);
    int *arrres = (int*)malloc(sizeof(int) * (m + 1));
    for (int i = 0; i < n; i++) {
        scanf("%d%d", &nneed, &nval);
        for (int j = nneed; j <= m; j++)
            if (arrres[j - nneed] + nval > arrres[j])
                arrres[j] = arrres[j - nneed] + nval;
    }
    printf("%d\n", arrres[m]);
    return 0;
}
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX