#include <bits/stdc++.h>
using namespace std;
int N; // liczba gości
int K; // liczba przedziałów
vector<int> guests;
int ans = 0;
int main() {
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
cin >> N >> K;
for (int i=0; i<N; i++) {
int T;
cin >> T;
guests.push_back(T);
}
ans = N;
priority_queue<int> Q; // < -dist >
for (int i=1; i<N; i++) Q.push(-(guests[i] - guests[i-1] - 1));
int intervals = N;
while (intervals > K) {
ans += -Q.top();
Q.pop();
intervals--;
}
cout << ans << '\n';
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |