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
52
53
54
55
56
57
58
59
60
61
62
63
64
#include <iostream>
#include <vector>
#include <unordered_set>
#include <algorithm>

using namespace std;

vector<vector<pair<int, int>>> GenerateResults(const vector<pair<int, int>>& pairs, int n) {
    vector<vector<pair<int, int>>> result;
    int totalCombinations = (1 << pairs.size());

    for (int mask = 0; mask < totalCombinations; ++mask) {
        vector<pair<int, int>> subset;
        unordered_set<int> usedFirstValues;

        for (int i = 0; i < pairs.size(); ++i) {
            if (mask & (1 << i)) {
                int first = pairs[i].first;
                if (usedFirstValues.find(first) == usedFirstValues.end()) {
                    usedFirstValues.insert(first);
                    subset.push_back(pairs[i]);
                }
            }
        }

        if (!subset.empty()) {
            result.push_back(move(subset));
        }
    }

    return result;
}

int main() {
    int k, n;
    cin >> k >> n;
    vector<pair<int, int>> pairs(k);

    for (int i = 0; i < k; i++) {
        cin >> pairs[i].first >> pairs[i].second;
    }

    sort(pairs.begin(), pairs.end(), greater<>());  

    auto results = GenerateResults(pairs, n);

    int maxResult = 0;
    for (const auto& subset : results) {
        int tempResult = 0;
        for (const auto& p : subset) {
            tempResult += p.first;
        }
        for (size_t i = 0; i < subset.size() - 1; i++) {
            if (subset[i].second != subset[i + 1].second) {
                tempResult -= n;
            }
        }

        maxResult = max(maxResult, tempResult);
    }

    cout << maxResult;
    return 0;
}