Submission #1257529

#TimeUsernameProblemLanguageResultExecution timeMemory
1257529bilgeyildizStove (JOI18_stove)C++20
100 / 100
48 ms1400 KiB
#include <bits/stdc++.h> using namespace std; const int N=1e5+5; int a[N],ans; vector<int> b; void solve(){ int n,k; cin>>n>>k; ans=n; for(int i=0;i<n;i++) cin>>a[i]; if(k>=n) { cout<<n<<endl; return;} if(k==1) { cout<<a[n-1]-a[0]+1<<endl; return;} for(int i=1;i<n;i++){ b.push_back(a[i]-a[i-1]-1); } sort(b.begin(),b.end()); for(int i=0;i<n-k;i++) ans+=b[i]; cout<<ans<<endl; } int main(){ solve(); }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...