Submission #206697

#TimeUsernameProblemLanguageResultExecution timeMemory
206697shortbread1Stove (JOI18_stove)C++14
100 / 100
81 ms2936 KiB
#include<bits/stdc++.h>

using namespace std;

long long int t[100005],razlika[100005];
int n,k;

int main()
{
    cin>>n>>k;

    for (int i=0;i<n;i++)
    {
        cin>>t[i];
    }

    long long int max_razlika=t[n-1]-t[0]+1;
    for (int i=1;i<n;i++)
    {
        razlika[i-1]=t[i]-t[i-1];
    }

    //for (int i=0;i<n-1;i++) cout<<razlika[i]<<endl;
    //cout<<max_razlika<<endl;

    sort(razlika,razlika+n-1);

    int br=0;
    long long int ukupno=0;

    while (br<k-1)
    {
        ukupno+=razlika[n-2-br]-1;
        br++;
    }

    cout<<max_razlika-ukupno;

    return 0;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...