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

#include <iostream>
#include <vector>
#include <algorithm>
#include <bitset>

class Solution {
public:
    int maxTotalReward(vector<int>& rewardValues) {
        int n = rewardValues.size();
        std::sort(rewardValues.begin(), rewardValues.end());
        rewardValues.erase(std::unique(rewardValues.begin(), rewardValues.end()), rewardValues.end());
        
        const int k = 50000 * 2;
        std::bitset<k> dp;
        
        dp[0] = 1;
        for (int r : rewardValues) {
            int shift = k - r;
            dp |= ((dp << shift) >> shift) << r;
        }
        
        for (int i = k - 1; i >= 0; --i) {
            if (dp[i]) {
                return i;
            }
        }
        
        return 0;
    }
};