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 MAXN (int)1e6
#define FOR(n) for(int i = 0; i < n; i++)
using namespace std;
int a[MAXN],b[MAXN];
int main(){
cin.tie(0);
ios::sync_with_stdio(0);
long long n,k; cin >> n >> k;
FOR(n) cin >> a[i];
sort(a,a+n);
if(k==1) {cout << a[n-1]-a[0]+1 << "\n"; return 0;}
long long m=0;
for(int i = 0; i < n; i++)if(a[i]+1!=a[i+1]) m++;
cout << n+m-k << "\n";
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... |