제출 #1241913

#제출 시각아이디문제언어결과실행 시간메모리
1241913quanaskingerStove (JOI18_stove)C++17
100 / 100
28 ms2312 KiB
#include <bits/stdc++.h> using namespace std; long long n, k; int main() { cin >> n >> k; long long arr[n + 5]; vector<long long> p; for (long long i = 1; i <= n; i++) { cin >> arr[i]; if (i >= 2) p.push_back(arr[i] - arr[i - 1] - 1); } k--; sort(p.begin(), p.end(), greater<long long>()); long long res = arr[n] + 1 - arr[1]; for (long long i = 0; i < min(k, n); i++) res -= p[i]; cout << res; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...