Submission #1276901

#TimeUsernameProblemLanguageResultExecution timeMemory
1276901kolpo0210Stove (JOI18_stove)C++20
100 / 100
39 ms1444 KiB
#include <bits/stdc++.h> using namespace std; int main() { int n, k; cin >> n >> k; vector<int>v(n); for(int i=0; i<n; i++) cin >> v[i]; if(k>=n) { cout << n; return 0; } sort(v.begin(), v.end()); vector<int>g; for(int i=0; i<n-1; i++) { int tmp = v[i+1]-(v[i]+1); g.push_back(tmp); } sort(g.begin(), g.end(), greater<>()); int sum=0; for(int i=0; i<k-1; i++) { sum+=g[i]; } cout << (v[n-1]+1-v[0])-sum; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...