Submission #293056

#TimeUsernameProblemLanguageResultExecution timeMemory
293056dolijanStove (JOI18_stove)C++14
100 / 100
97 ms3312 KiB
#include <bits/stdc++.h>
typedef long long ll;
using namespace std;
int main()
{
    ll n,k;
    cin>>n>>k;
    ll a[n];
    for(int i=0;i<n;i++) cin>>a[i];
    vector<ll> diff;
    for(int i=1;i<n;i++) diff.push_back(a[i]-a[i-1]);
    sort(diff.begin(),diff.end());
    ll kolko=0;
    k--;
    for(int i=diff.size()-1;i>=(int)diff.size()-k;i--) kolko+=diff[i];
    kolko=((a[n-1]-a[0])-kolko);
    kolko+=(k+1);
    cout<<kolko<<endl;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...