Submission #1147634

#TimeUsernameProblemLanguageResultExecution timeMemory
1147634aqxaStove (JOI18_stove)C++17
100 / 100
12 ms968 KiB
#include <iostream> #include <vector> #include <algorithm> using namespace std; int main() { cin.sync_with_stdio(0); cin.tie(0); int n,k,a; vector<int> gaps; cin >> n >> k; int last = -1; int first = -1; while (n--) { cin >> a; if (last == -1) { last = a+1; first = a; } else { gaps.push_back(a-(last)); } last = a + 1; } a = a - first + 1; sort(gaps.begin(),gaps.end(),greater<int>()); k-=1; for (int i = 0; i <k;i++){ a -= gaps[i]; } cout << a << "\n"; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...