제출 #1097630

#제출 시각아이디문제언어결과실행 시간메모리
1097630saxStove (JOI18_stove)C++17
0 / 100
0 ms348 KiB
#include <bits/stdc++.h> #define int long long ///#define pragma GCC optimise("O3") using namespace std; signed main() { int n, k; cin>>n>>k; vector <int> dif; int aux=0, all=0; for (int i=1; i<=n; i++) { int a; cin>>a; if (i>1) dif.push_back(a-aux); if (i==1) all=a; if (i==n) all=a+1-all; aux=a+1; } sort(dif.begin(), dif.end(), greater<int>()); k--; for (auto x:dif) { k--; all-=x; if (k==0) break; } cout<<all<<endl; return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...