Submission #978240

#TimeUsernameProblemLanguageResultExecution timeMemory
978240wateronennStove (JOI18_stove)C++17
0 / 100
1 ms348 KiB
#include<bits/stdc++.h> using namespace std; const int N = 1e5+9; int arr[N]; int main(){ cin.tie(0)->sync_with_stdio(false); int n,k; cin>>n>>k; for(int i=1;i<=n;i++){ cin>>arr[i]; } if(k==1){ cout<<(*max_element(arr+1,arr+n+1) - *min_element(arr+1,arr+n+1)+1); return 0; } sort(arr+1,arr+n+1); int mk = 1; for(int i=1;i<=n;i++){ if(arr[i] - arr[i-1]>1) mk++; } if(mk>k) cout<<n+mk-k; else cout<<n; return 0; } /* 3 1 1 3 6 */
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...