Submission #931949

#TimeUsernameProblemLanguageResultExecution timeMemory
931949hlk28khuongStove (JOI18_stove)C++17
100 / 100
18 ms4700 KiB
#include <bits/stdc++.h> using namespace std; #define int long long #define isz(a) ((int)(a.size())) const int mxn=1e6+7; int a[mxn]; vector<int>val; int n,k; signed main() { ios_base::sync_with_stdio(0); cin.tie(0); cin>>n>>k; k--; for(int i=1;i<=n;i++) { cin>>a[i]; if(i!=1) val.push_back(a[i]-a[i-1]-1); } sort(val.begin(),val.end(),greater<int>()); int res=a[n]-a[1]+1; for(int i=0;i<min(k,isz(val));i++) { res-=val[i]; } cout<<res; return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...