Submission #1331228

#TimeUsernameProblemLanguageResultExecution timeMemory
1331228theem1502Stove (JOI18_stove)C++20
100 / 100
37 ms1436 KiB
#include <bits/stdc++.h>
using namespace std;

int main() {
    int num, can;
    cin >> num >> can;
    can--;
    vector<int> thearray(num);
    for (int i = 0; i < num; i++) {
        cin >> thearray[i];
    }
    vector<int> gaps;
    for (int i = 0; i < num - 1; i++) {
        gaps.push_back(thearray[i+1] - thearray[i]);
    }
    sort(gaps.begin(), gaps.end(), greater<int> ());
    int thenum = thearray[num - 1] - thearray[0] + 1;
    for (int i = 0; i < min(can, num); i++) {
        thenum -= gaps[i] - 1;
    }
    cout << thenum;

}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...