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 MAX 100005
using namespace std;
int t[MAX];
int dif[MAX];
bool crt(int a,int b)
{
return a>b;
}
int main()
{
int n,k;
cin>>n>>k;
int i;
for(i=1;i<=n;++i)
cin>>t[i];
int total=t[n]-t[1]+1;
for(i=1;i<n;++i)
dif[i]=t[i+1]-t[i]-1;
sort(dif+1,dif+n,crt);
for(i=1;i<k;++i)
total-=dif[i];
cout<<total;
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... |