제출 #1196547

#제출 시각아이디문제언어결과실행 시간메모리
1196547amanthabandStove (JOI18_stove)C++20
100 / 100
31 ms1896 KiB
#include <iostream> #include <vector> #include <algorithm> using namespace std; int main() { int n, k; cin >> n >> k; vector<int> a(n); for (int &x : a) cin >> x; sort(a.begin(), a.end()); vector<int> d; for (int i = 1; i < n; i++) d.push_back(a[i] - a[i - 1] - 1); sort(d.begin(), d.end(), greater<int>()); k = n - k; while (k-- && !d.empty()) { n += d.back(); d.pop_back(); } cout << n << endl; return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...