Submission #1029519

#TimeUsernameProblemLanguageResultExecution timeMemory
1029519nisanduuStove (JOI18_stove)C++14
100 / 100
37 ms3328 KiB
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
void solve(){
    ll n,k;
    cin>>n>>k;
    vector<ll> v(n),arr;
    for(ll i=0;i<n;i++) cin>>v[i];
    ll tot = v[n-1] - v[0] + 1;
    for(ll i=1;i<n;i++) arr.push_back(v[i] - v[i-1] - 1);
    sort(arr.begin(),arr.end(),greater<ll>());
    for(ll i=0;i<(k-1);i++) tot -= arr[i];
    cout<<tot<<endl;
}
int main()
{
    solve();

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