Submission #997496

#TimeUsernameProblemLanguageResultExecution timeMemory
997496vjudge1Stove (JOI18_stove)C++17
100 / 100
41 ms2908 KiB
#include<bits/stdc++.h> using namespace std; using ll = long long; int main(){ ll t = 1; while(t--) { ll n, k; cin >> n >> k; ll t1[n], s[n - 1]; for (int i = 0;i < n; i++) { cin >> t1[i]; if (i > 0) { s[i - 1] = t1[i] - t1[i - 1] - 1; } } sort(s, s + n - 1); ll sum = n; for (int i = 0;i < n - k; i++) { sum += s[i]; } cout << sum; } return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...