| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1329782 | kasamchi | Stove (JOI18_stove) | C++20 | 14 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);
for (int i = 0; i < N; i++) {
cin >> T[i];
}
vector<int> diff;
for (int i = 1; i < N; i++) {
diff.push_back(T[i] - T[i - 1] - 1);
}
sort(diff.begin(), diff.end(), greater<>());
int ans = T[N - 1] - T[0] + 1;
for (int i = 0; i + 1 < K; i++) {
ans -= diff[i];
}
cout << ans << '\n';
}| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
