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 FOR(n) for(int i = 0; i < n; i++)
#define ll long long
using namespace std;
int n,k,a[100000],b[100000];
int main()
{
ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);cerr.tie(0);
cin >> n >> k;
FOR(n) cin >> a[i];
sort(a,a+n);
int ans = n;
int m = 1;
for(int i = 0; i < n -1;i ++) {b[i] = a[i+1]-a[i]-1;if(b[i]!=0)m++;}
sort(b,b+n-1);
int j = 0;
int cnt = 0;
while(cnt<m-k){
if(b[j]!=0) ans += b[j],cnt++;
j++;
}
cout << ans << endl;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |