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 endl '\n'
using namespace std;
const long long MAXN = 1e5 + 10;
void speed()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
}
long long n, k, a[MAXN];
void read()
{
cin >> n >> k;
for (long long i = 1; i <= n; ++ i)
cin >> a[i];
}
void solve()
{
vector < long long > g;
long long ans = a[n] - a[1] + 1;
for (long long i = 2; i <= n; ++ i)
{
g.push_back(- (a[i] - a[i-1] - 1));
}
sort(g.begin(), g.end());
long long i = 0;
//cout << ans << endl;
while(i < k-1)
{
ans += g[i];
// cout << g[i] << endl;
i ++;
}
cout << ans << endl;
}
int main()
{
speed();
read();
solve();
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... |