Submission #648184

#TimeUsernameProblemLanguageResultExecution timeMemory
648184IrocansStove (JOI18_stove)C++14
100 / 100
54 ms664 KiB
#include <iostream>
#include <algorithm>
using namespace std;

int main()
{
    int n,k,i,b;
    cin >> n>>k;
    k--;
    int a[n];
    cin >> a[0];
    b=a[0];
    for (i=1;i<n;i++) {
        cin >> a[i];
        a[i-1]=a[i]-a[i-1]-1;
    }
    b=a[n-1]-b+1;
    sort(a,a+n-1);
    i=n-2;
    while (k>0) {
        b=b-a[i];
        i--;
        k--;
    }
    cout << b;
    return 0;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...