제출 #543753

#제출 시각아이디문제언어결과실행 시간메모리
543753tudorStove (JOI18_stove)C++17
100 / 100
56 ms1632 KiB
#include <iostream> #include <algorithm> using namespace std; const int nmax = 1e5; int v[nmax]; int main() { int n, k, a, b; cin >> n >> k >> a; for ( int i = 1; i < n; i++ ) { cin >> b; v[i] = b - a - 1; a = b; } sort ( v + 1, v + n ); int s = n; for ( int i = 1; i <= n - k; i++ ) s += v[i]; cout << s; return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...