This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include<bits/stdc++.h>
using namespace std;
const int maxn = 1e5+5;
int guest[maxn];
int main() {
int N, K;
cin >> N >> K;
priority_queue<int, vector<int>, greater<int>>pq;
for(int i=1; i<=N; i++) {
cin >> guest[i];
}
int oprtime = N;
for(int i=2; i<=N; i++) {
int valtime = guest[i]-guest[i-1];
pq.push(valtime-1);
}
for(int i=1; i<=N-K; i++) {
oprtime+=pq.top();
pq.pop();
}
cout << oprtime << endl;
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |