| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1339499 | chry | Stove (JOI18_stove) | C++20 | 13 ms | 1480 KiB |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n, k;
cin >> n >> k;
vector<int> T(n+1);
for (int i = 1; i <= n; i++) cin >> T[i];
if (k >= n) {
cout << n << '\n';
return 0;
}
vector<int> gap;
for (int i = 2; i <= n; i++) gap.push_back(T[i] - T[i-1]);
sort(gap.rbegin(), gap.rend());
long long ans = T[n] - T[1] + 1;
for (int i = 0; i < k-1; i++) {
ans -= (gap[i] - 1);
}
cout << ans << '\n';
return 0;
}| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
