Submission #1313684

#TimeUsernameProblemLanguageResultExecution timeMemory
1313684fahim903Stove (JOI18_stove)C++20
100 / 100
36 ms2324 KiB
#include <bits/stdc++.h> using namespace std; typedef long long ll; int main() { ll n,k; cin>>n>>k; vector<ll> a(n); vector<ll> gap; cin>>a[0]; for(int i = 1;i<n;i++){ cin>>a[i]; gap.push_back(a[i]-a[i-1]); } sort(gap.begin(),gap.end()); ll ans = a[n-1] - a[0]+1; ll f = n-2; if(k>n)k=n; for(int i = 0;i<k-1;i++){ ans -= gap[f-i] -1; } cout<<ans<<endl; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...