Submission #916471

#TimeUsernameProblemLanguageResultExecution timeMemory
916471vjudge1Stove (JOI18_stove)C++11
100 / 100
44 ms2380 KiB
#include <bits/stdc++.h>
using namespace std;

int N, K, A[100100], ans;
vector<int> v;

int main() 
{
    cin >> N >> K;
    for(int i=1; i<=N; i++) {
        cin >> A[i];
    }
    sort(A+1, A+N+1);
    for(int i=1; i<N; i++) {
        if (A[i+1] > A[i]+1) {
            v.push_back(A[i+1]-A[i]-1);
        }
    }
    sort(v.begin(), v.end(), greater<int>());
    for(int i=0; i<min(K-1,(int)v.size()); i++) {
        ans += v[i];
    }
    cout << A[N]-A[1]+1-ans << endl;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...