제출 #909947

#제출 시각아이디문제언어결과실행 시간메모리
909947raphaelpStove (JOI18_stove)C++14
100 / 100
49 ms2688 KiB
#include <bits/stdc++.h> using namespace std; int main() { int N, K; cin >> N >> K; K--; vector<int> Tab(N); for (int i = 0; i < N; i++) { cin >> Tab[i]; } sort(Tab.begin(), Tab.end()); vector<int> dif; for (int i = 1; i < N; i++) { dif.push_back(Tab[i] - Tab[i - 1]); } sort(dif.begin(), dif.end()); int tot = 1; for (int i = 0; i < N - 1; i++) { if (i < N - 1 - K) tot += dif[i]; else tot += 1; } cout << tot; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...