제출 #210185

#제출 시각아이디문제언어결과실행 시간메모리
210185grobarStove (JOI18_stove)C++14
0 / 100
5 ms248 KiB
#include <bits/stdc++.h> using namespace std; int main() { int n,k; cin>>n>>k; int a[n]; // vector< pair<int,int> >par; int sum=0; for(int i=0;i<n;i++) { cin>>a[i]; sum=sum+a[i]; //par.push_back(make_pair(a[i],a[i]+1)); } if(k==1) { cout<<sum<<endl; return 0; } if(k==n) { cout<<k<<endl; return 0; } int kk=a[n-1]-a[0]+2; vector<int>v; for(int i=0;i<=(n-2);i++) { v.push_back(a[i+1]-a[i]-1); } sort(v.begin(),v.end()); int j=v.size()-1; while(k>0) { kk=kk-v[j]; j--; k--; } cout<<kk<<endl; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...