Submission #541967

#TimeUsernameProblemLanguageResultExecution timeMemory
541967DemonLord154Stove (JOI18_stove)C++14
0 / 100
0 ms212 KiB
#include<iostream> #include<vector> #include<bits/stdc++.h> using namespace std; int main(){ int n,k; cin>>n>>k; vector<int> vec(n); for (int i=0;i<n;i++){ cin>>vec[i]; } sort(vec.begin(),vec.end()); vector<int> intervals; for (int i=1;i<n;i++){ if (vec[i]-vec[i-1]-1>0){ intervals.push_back(vec[i]-vec[i-1]-1); } } sort(intervals.begin(),intervals.end()); if ((int)intervals.size()<k){ cout<<n<<"\n"; } else{ int ans=0; for (int i=0;i<n-k-1;i++){ ans+=intervals[i]; } cout<<(n+ans)<<"\n"; } }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...