This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
//
// JOI18_STOVE.cpp
//
//
// Created by Matjaz Leonardis on 25/01/2024.
//
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main(){
int N,K;
cin >> N >> K;
vector<int> T(N);
vector<int> gap(N - 1);
for (int i=0;i<N;i++){
cin >> T[i];
if (i > 0) gap[i - 1] = T[i] - T[i-1] - 1;
}
int time_on = T[N-1] - T[0] + 1;
int ngaps = K - 1;
sort(gap.rbegin(), gap.rend());
for (int i=0;i<ngaps;i++) time_on -= gap[i];
cout << time_on << 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... |