Submission #1009992

#TimeUsernameProblemLanguageResultExecution timeMemory
1009992JovicaStove (JOI18_stove)C++14
100 / 100
34 ms3148 KiB
#include <bits/stdc++.h>

using namespace std;
vector<long long> v;

int main()
{
    long long n,k;
    cin>>n>>k;
    priority_queue<long long> q;
    for (long long i=0;i<n;i++)
    {
        long long a;
        cin>>a;
        v.push_back(a);
        if (i>0) q.push(-(v[i]-v[i-1]-1));
    }
    long long odg=n;

    for (long long i=n;i>k;i--)
    {
        long long x = abs(q.top());
        q.pop();
        //cout<< "dodava "<<x<<endl;
        odg+=x;
    }

    cout<<odg<<endl;
    return 0;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...