Submission #653706

#TimeUsernameProblemLanguageResultExecution timeMemory
653706sofija6Stove (JOI18_stove)C++14
100 / 100
22 ms3284 KiB
#include <bits/stdc++.h>
#define ll long long
#define MAXN 100010
using namespace std;
ll t[MAXN];
vector<ll> d;
int main()
{
    ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
    ll n,k,ans;
    cin >> n >> k;
    for (ll i=1;i<=n;i++)
        cin >> t[i];
    ans=t[n]+1-t[1];
    for (ll i=2;i<=n;i++)
        d.push_back(t[i]-t[i-1]-1);
    sort(d.begin(),d.end(),greater<ll>());
    for (ll i=0;i<k-1;i++)
        ans-=d[i];
    cout << ans;
    return 0;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...