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, sil = 0;
cin >> n >> k;
vector<int> vec(n), a;
for(int i = 0; i < n; i++)
{
cin >> vec[i];
if(i > 0)
a.push_back(vec[i] - vec[i-1] - 1);
}
sort(a.rbegin(), a.rend());
for(int i = 0; i < k-1; i++)
{
sil += a[i];
}
cout << vec[n-1] + 1 - vec[0] - sil << 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... |