Submission #1097631

#TimeUsernameProblemLanguageResultExecution timeMemory
1097631saxStove (JOI18_stove)C++17
100 / 100
33 ms2356 KiB
#include <bits/stdc++.h>
#define int long long
///#define pragma GCC optimise("O3")

using namespace std;

signed main()
{
    int n, k; cin>>n>>k;
    vector <int> dif;
    int aux=0, all=0;
    for (int i=1; i<=n; i++)
    {
        int a; cin>>a;
        if (i>1) dif.push_back(a-aux);
        if (i==1) all=a;
        if (i==n) all=a+1-all;
        aux=a+1;
    }

    sort(dif.begin(), dif.end(), greater<int>());

    k--;
    for (auto x:dif)
    {
        if (k==0) break;
        k--;
        all-=x;
    }
    cout<<all<<endl;
    return 0;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...