Submission #998995

#TimeUsernameProblemLanguageResultExecution timeMemory
998995Angus_YeungStove (JOI18_stove)C++17
100 / 100
14 ms2204 KiB
#include <bits/stdc++.h> #define x first #define y second #define pii pair<ll, ll> typedef long long ll; const ll MOD = 1000000007LL; const ll INF = 1e15; using namespace std; ll n, k, t[100010], ans; int main() { cin.tie(0); cout.tie(0); ios::sync_with_stdio(0); cin >> n >> k; for (int i = 1; i <= n; i++) cin >> t[i]; ans = t[n]-t[1]+1; for (int i = n; i >= 1; i--) t[i] -= t[i-1]+1; sort(t+2, t+n+1, greater<ll>()); for (int i = 2; i <= k; i++) ans -= t[i]; cout << ans << "\n"; return 0; } /* */
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...