Submission #1240230

#TimeUsernameProblemLanguageResultExecution timeMemory
1240230ciao_gioStove (JOI18_stove)C++20
100 / 100
47 ms1220 KiB
#include <bits/stdc++.h> using namespace std; int main() { int N, K; cin >> N >> K; vector<int> T(N); for (int i = 0; i < N; i++) { cin >> T[i]; } priority_queue<int> q; for (int i = 1; i < N; i++) { q.push(T[i] - T[i - 1] - 1); } int r = T[N - 1] - T[0] + 1; for (int i = 0; i < K - 1; i++) { r -= q.top(); q.pop(); } cout << r << '\n'; return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...