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;
int main()
{
int n,k;
cin >> n >> k;
int a[n];
vector<int> v;
for (int i=0;i<n;i++)
{
cin >> a[i];
if (i>0)
v.push_back(a[i]-a[i-1]-1);
}
sort(v.begin(),v.end());
long long vk=a[n-1]-a[0]+1;
k--;
while (k>0&&v.size()>0)
{
vk-=v.back();
v.pop_back();
k--;
}
cout << vk;
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... |