Submission #1241932

#TimeUsernameProblemLanguageResultExecution timeMemory
1241932phannibleStove (JOI18_stove)C++20
100 / 100
12 ms1224 KiB
#include<bits/stdc++.h>
#define ll long long
#define endl '\n'
#define maxn 100005
using namespace std;

int a[maxn];
vector<int>v;


signed main(){
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);

    int n,k;
    cin>>n>>k;

    ll ans=0;

    for(int i=1;i<=n;++i){
        cin>>a[i];

        if(i>1){
            v.push_back(a[i]-a[i-1]-1);
        }
    }

    ans+=a[n]+1-a[1];
    sort(v.rbegin(),v.rend());

  for(int i = 0; i < k-1 && i < (int)v.size(); ++i){
    ans -= v[i];
  }


    cout<<ans;






































}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...