Submission #17226597

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;

int main()
{
    int N;
    int M;
    cin >> N >> M;
    vector<int> P_vec(N + 1, 0);
    for (int i = 1; i <= N; ++i)
        cin >> P_vec.at(i);
    vector<int> Q_vec((N + 1) * (N + 2) / 2);
    for (int i = 0; i <= N; ++i) {
        for (int j = 0; j <= i; ++j) {
            int idx = i * (i + 1) / 2 + j;
            Q_vec.at(idx) = P_vec.at(i) + P_vec.at(j);
        }
    }
    auto comp = greater<int>();
    sort(Q_vec.begin(), Q_vec.end(), comp);
    int max_score = 0;
    for (int q1 : Q_vec) {
        if (q1 > M)
            continue;
        int q2 = *lower_bound(Q_vec.begin(), Q_vec.end(), M - q1, comp);
        int score = q1 + q2;
        if (max_score < score)
            max_score = score;
    }
    cout << max_score << endl;
}

Submission Info

Judge Result