Submission #1012992

#TimeUsernameProblemLanguageResultExecution timeMemory
1012992aufanStove (JOI18_stove)C++17
100 / 100
16 ms3368 KiB
#include <bits/stdc++.h> #define int long long #define fi first #define se second using namespace std; int32_t main() { ios_base::sync_with_stdio(false); cin.tie(NULL); int n, k; cin >> n >> k; vector<int> t(n + 1); for (int i = 1; i <= n; i++) cin >> t[i]; vector<int> b; for (int i = 1; i <= n - 1; i++) b.push_back(t[i + 1] - t[i]); sort(b.rbegin(), b.rend()); int ans = t[n] + 1 - t[1]; for (int i = 0; i < k - 1; i++) { ans -= (b[i] - 1); } cout << ans << '\n'; return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...