Submission #1003744

#TimeUsernameProblemLanguageResultExecution timeMemory
1003744codexistentStove (JOI18_stove)C++14
0 / 100
0 ms348 KiB
#include <bits/stdc++.h> using namespace std; #define MAXN 100005 #define FOR(i, a, b) for(int i = a; i <= b; i++) int n, m, arr[MAXN]; int main(){ cin >> n >> m; FOR(i, 1, n) cin >> arr[i]; sort(arr + 1, arr + 1 + n); multiset<int> s; FOR(i, 1, n - 1) s.insert(arr[i + 1] - arr[i] - 1); int res = arr[n] - arr[1] + 1; while(s.size() && m){ res -= *(s.rbegin()); s.erase(s.find(*(s.rbegin()))); m--; } cout << res << endl; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...