Submission #1033777

#TimeUsernameProblemLanguageResultExecution timeMemory
1033777vjudge1Stove (JOI18_stove)C++17
0 / 100
0 ms344 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; int main() { cin >> n >> k; cin >> t[1]; sum += t[1]; for(int i = 2; i <= n; i++) { cin >> t[i]; pq.push(t[i] - t[i - 1]); } k = n - k; ll res = n; while(!pq.empty() && k > 0) { res = res - pq.top(); //cout << pq.top() << ' '; pq.pop(); k--; } cout << n + 1; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...