Submission #995666

#TimeUsernameProblemLanguageResultExecution timeMemory
995666kokoueStove (JOI18_stove)C++14
20 / 100
1 ms348 KiB
#include<bits/stdc++.h> #define maxn 100010 using namespace std; int n,k; vector<long long> t; int a[maxn]; int main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); cin>>n>>k; for(int i=0;i<n;i++) { cin>>a[i]; if(i!=0) {t.push_back(a[i]-a[i-1]-1);continue;} t.push_back(a[i]-1); } sort(t.begin(),t.end()); long long ans=a[n-1]-a[0]+1; for(int i=0;i<k-1;i++) { ans-=t[t.size()-i-1]; } cout<<ans<<"\n"; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...