Submission #756190

#TimeUsernameProblemLanguageResultExecution timeMemory
756190thinknoexitStove (JOI18_stove)C++17
100 / 100
19 ms2132 KiB
#include <bits/stdc++.h> using namespace std; using ll = long long; int a[100100]; int b[100100]; int main() { cin.tie(nullptr)->sync_with_stdio(false); int n, k; cin >> n >> k; for (int i = 1;i <= n;i++) { cin >> a[i]; } for (int i = 1;i < n;i++) { b[i] = a[i + 1] - a[i]; } sort(b + 1, b + n, greater<int>()); int mn = a[n] - a[1] + 1; int now = a[n] - a[1] + 1; for (int i = 2;i <= k;i++) { now -= b[i - 1]; now++; mn = min(mn, now); } cout << mn << '\n'; return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...