Submission #1115204

#TimeUsernameProblemLanguageResultExecution timeMemory
1115204staszic_ojuzStove (JOI18_stove)C++17
100 / 100
19 ms1164 KiB
#include <bits/stdc++.h> using namespace std; int wynik = 0; priority_queue<int> que; int main(){ ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); int n, k, a, b; cin >> n >> k; for(int i = 0; i < n; i++){ cin >> a; wynik++; if(i > 0){ que.push(b + 1 - a); } b = a; } while(n > k){ n--; wynik -= que.top(); que.pop(); } cout << wynik; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...