Submission #318817

#TimeUsernameProblemLanguageResultExecution timeMemory
318817vojinStove (JOI18_stove)C++14
0 / 100
1 ms364 KiB
#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 timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...