hihoCoder#1038 01背包

原题地址

基本动态规划

代码：

#include <iostream>

using namespace std;

int main() {
    int N, M;
    int score[100010];
    int need[512];
    int value[512];

    cin >> N >> M;

    for (int i = 0; i < N; i++)
        cin >> need[i] >> value[i];

    for (int i = 0; i <= M; i++)
        score[i] = 0;

    for (int i = 0; i < N; i++)
        for (int j = M; j >= need[i]; j--)
            score[j] = max(score[j], value[i] + score[j - need[i]]);

    cout << score[M] << endl;

    return 0;
}