Submission #1155636

#TimeUsernameProblemLanguageResultExecution timeMemory
1155636stefdascaStove (JOI18_stove)C++17
100 / 100
30 ms1864 KiB
#include <iostream> #include <vector> #include <algorithm> using namespace std; int main(){ int n, k; cin >> n >> k; vector<long long> arr(n); for(int i = 0; i < n; i++){ cin >> arr[i]; } vector<long long> dif(n-1); for(int i = 0; i < n-1; i++){ dif[i] = arr[i+1] - arr[i] - 1; } sort(dif.begin(), dif.end(), greater<long long>()); long long total = arr[n-1] - arr[0] + 1; for(int i = 0; i < k-1 && i < dif.size(); i++){ total -= dif[i]; } cout << total << endl; return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...