Submission #863832

#TimeUsernameProblemLanguageResultExecution timeMemory
863832HataNoKokoroStove (JOI18_stove)C++17
100 / 100
62 ms6484 KiB
#include <iostream>
#include <set>

using namespace std;

const int maxN = 1e5;

int n, k, res;
int T[maxN];
multiset<int, greater<int> > helper;

int main() {
    cin >> n >> k >> T[0];
    for(int i = 1; i < n; i++)
    {
        cin >> T[i];
        helper.insert(T[i] - T[i - 1]);
    }
    res = T[n - 1] - T[0];

    for(int i = 1; i < k; i++)
    {
        res -= *helper.begin();
        helper.erase(helper.begin());
    }
    cout << res + k;
    return 0;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...