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 ll long long
using namespace std;
int n, k;
const int maxn = 2e5;
ll t[maxn + 3];
priority_queue<ll>pq;
ll sum;
ll mx;
int main()
{
// freopen("STOVEN.INP", "r", stdin);
//freopen("STOVEN.OUT", "w", stdout);
cin >> n >> k;
for(int i = 1; i <= n; i++)
{
cin >> t[i];
}
sort(t + 1, t + n + 1);
ll res = t[n] + 1 - t[1];
for(int i = 2; i <= n; i++)
{
pq.push(t[i] - t[i - 1] - 1);
}
k = k - 1;
while(k > 0 && pq.size())
{
res -= pq.top();
//cout << pq.top() << ' ' ;
pq.pop();
k--;
}
cout << res;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |