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;
#define int long long
int n, k, t[100010], cnt;
vector<int> temp;
signed main()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cin >> n >> k;
for (int i = 1; i <= n; i++)
{
cin >> t[i];
}
sort(t + 1, t + n + 1);
for (int i = 1; i <= n - 1; ++i)
{
temp.push_back(t[i + 1] - t[i] - 1);
}
cnt = t[n] - t[1] + 1;
sort(temp.begin(), temp.end(), greater<int>());
for (int i = 0; i < k - 1; i++)
{
cnt = cnt - temp[i];
}
cout << cnt;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |