Submission #128143

#TimeUsernameProblemLanguageResultExecution timeMemory
128143Osama_AlkhodairyCake 3 (JOI19_cake3)C++17
0 / 100
2 ms376 KiB
#include <bits/stdc++.h>
using namespace std;
#define finish(x) return cout << x << endl, 0
#define ll long long

int n, m;
vector <pair <int, int> > a;

int main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cin >> n >> m;
    a.resize(n);
    for(auto &i : a) cin >> i.second >> i.first;
    sort(a.begin(), a.end());
    ll ans = 0;
    ll sumv = 0;
    for(int i = 0 ; i < n ; i++){
        sumv += a[i].second;
        int j = i - m + 1;
        if(j >= 0){
            ans = max(ans, sumv - 2 * (a[i].first - a[j].first));
            sumv -= a[j].second;
        }
    }
    cout << ans << endl;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...