Submission #1228965

#TimeUsernameProblemLanguageResultExecution timeMemory
1228965who-read-is-dogStove (JOI18_stove)C++20
100 / 100
34 ms1836 KiB
#include<bits/stdc++.h> using namespace std; typedef long long ll; const int N = 1e5 + 5; vector<int> a(N); vector<int> vcl(N); priority_queue<int> pq; int main(){ int n, t; cin >> n >> t; for(int i = 1; i <= n; i++) cin >> a[i]; int maxping = a[n] + 1 - a[1]; for(int i = 2; i <= n; i++){ vcl[i] = (a[i] - 1 - a[i - 1]); pq.push(vcl[i]); } for(int i = 0; i < t - 1 and !pq.empty(); i++){ maxping -= pq.top(); pq.pop(); } cout << maxping; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...