Submission #1033780

#TimeUsernameProblemLanguageResultExecution timeMemory
1033780vjudge1Stove (JOI18_stove)C++17
0 / 100
0 ms348 KiB
#include<bits/stdc++.h> #define ll long long using namespace std; int n, k; const int maxn = 2e5; ll t[maxn + 3]; priority_queue<ll>pq; ll sum; ll mx; int main() { cin >> n >> k; for(int i = 1; i <= n; i++) { cin >> t[i]; } sort(t + 1, t + n + 1); ll res = t[n] + 1; for(int i = 2; i <= n; i++) { pq.push(t[i] - t[i - 1] - 1); } k = n - k; while(k > 0 && pq.size()) { res -= pq.top(); k--; } cout << res; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...