Submission #1151758

#TimeUsernameProblemLanguageResultExecution timeMemory
1151758tegsheeStove (JOI18_stove)C++20
100 / 100
13 ms2244 KiB
#include<bits/stdc++.h> #define int long long #define ss second #define ff first #define pb push_back const int mxn=1e6+5; const int mod=998244353; using namespace std; int n,k; int a[mxn+7],f[mxn+7]; signed main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); cin>>n>>k; for(int i=1; i<=n; i++) {cin>>a[i]; } int s=a[n]-a[1]+1; vector<int> v; for(int i=1; i<n; i++) {v.pb(a[i+1]-a[i]-1); } sort(v.begin(),v.end(),greater<int>()); for(int i=0; i<k-1; i++) {s-=v[i]; } cout<<s; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...