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>
#define fi first
#define se second
#define wii(x) cout << #x << " = " << x << endl;
typedef long long ll;
using namespace std;
priority_queue<int> q;
int main()
{
int n, k;
cin >> n >> k;
int t[n];
for(int i = 0; i < n; i++)
{
cin >> t[i];
}
sort(t, t + n);
int c = t[n - 1] - t[0] + 1;
for(int i = 0; i < n - 1; i++)
{
q.push(t[i + 1] - t[i] - 1);
}
for(int i = 0; i < k - 1; i++)
{
c -= q.top();
q.pop();
}
cout << c;
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... |