Submission #1229101

#TimeUsernameProblemLanguageResultExecution timeMemory
1229101dnamStove (JOI18_stove)C++20
100 / 100
30 ms1220 KiB
#include<bits/stdc++.h> using namespace std; int main() { int n; int k; cin>>n>>k; vector<int> t(n); for(int i=0;i<n;i++) cin>>t[i]; sort(t.begin(),t.end()); int tong=n; int doan=1; vector<int> kc; for(int i=1;i<n;i++){ int kcc=t[i]-t[i-1]-1; if(kcc>0){ doan++; kc.push_back(kcc); } } if(doan<=k){ cout<<n; return 0; } sort(kc.begin(),kc.end()); int gop=doan-k; for(int i=0;i<gop;i++){ tong+=kc[i]; } cout<<tong; return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...