Submission #472937

#TimeUsernameProblemLanguageResultExecution timeMemory
472937dron_rpStove (JOI18_stove)C++14
100 / 100
23 ms2076 KiB
#include <bits/stdc++.h> using namespace std; using ll = long long; int main(){ ios::sync_with_stdio(false); cin.tie(nullptr); int n, k; cin >> n >> k; vector<int> a(n); for (int i = 0; i<n; i++){ cin >> a[i]; } vector<int> gapSize(n-1); for (int i = 0; i<n-1; i++){ gapSize[i] = a[i+1]-a[i]-1; } sort(gapSize.rbegin(), gapSize.rend()); int ans = a[n-1]+1 - a[0]; for (int i = 0; i<k-1; i++){ ans -= gapSize[i]; } cout << ans << "\n"; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...