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;
K--;
vector<int> Tab(N);
for (int i = 0; i < N; i++)
{
cin >> Tab[i];
}
sort(Tab.begin(), Tab.end());
vector<int> dif;
for (int i = 1; i < N; i++)
{
dif.push_back(Tab[i] - Tab[i - 1]);
}
sort(dif.begin(), dif.end());
int tot = 1;
for (int i = 0; i < N - 1; i++)
{
if (i < N - 1 - K)
tot += dif[i];
else
tot += 1;
}
cout << tot;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |