제출 #889236

#제출 시각아이디문제언어결과실행 시간메모리
889236alexander707070Stove (JOI18_stove)C++14
100 / 100
43 ms2332 KiB
#include<bits/stdc++.h> #define MAXN 100007 using namespace std; int n,k; int t[MAXN],ans; vector<int> diff; int main(){ cin>>n>>k; for(int i=1;i<=n;i++){ cin>>t[i]; } ans=t[n]+1-t[1]; for(int i=2;i<=n;i++){ diff.push_back(t[i]-(t[i-1]+1)); } sort(diff.begin(),diff.end()); reverse(diff.begin(),diff.end()); for(int i=0;i<k-1;i++){ ans-=diff[i]; } cout<<ans<<"\n"; return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...