Submission #1178461

#	Time	Username	Problem	Language	Result	Execution time	Memory
1178461		peteza	Cake 3 (JOI19_cake3)	C++20	5 / 100	4096 ms	328 KiB

cake3

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

int n, k;
vector<pair<int, int>> vec;

int main() {
    cin >> n >> k;
    vec.resize(n);
    for(int i=0;i<n;i++) {
        cin >> vec[i].second >> vec[i].first;
        vec[i].first *= 2;
    }
    sort(vec.begin(), vec.end());
    long long best = LLONG_MIN;
    for(int i=0;i<n;i++) {
        for(int j = i + k - 1; j<n;j++) {
            vector<int> tosort;
            for(int bb = i; bb <= j; bb++) tosort.push_back(vec[bb].second);
            sort(tosort.rbegin(), tosort.rend());
            long long sum = 0;
            for(int i=0;i<k;i++) sum += tosort[i];  
            sum = sum - vec[j].first + vec[i].first;
            best = max(best, sum);
        }
    }
    cout << best;
}

• Subtask 1: 5 / 5
• Subtask 2: 0 / 19
• Subtask 3: 0 / 76