| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1214496 | cuenta_verdadera | Stove (JOI18_stove) | C++20 | 31 ms | 1444 KiB |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
vector<int> T(N);
for (int i = 0; i < N; ++i) {
cin >> T[i];
}
vector<int> v;
for (int i = 0; i < N - 1; ++i) {
int g = T[i + 1] - (T[i] + 1);
v.push_back(g);
}
sort(v.begin(), v.end());
long long result = N;
for (int i = 0; i < N - K; ++i) {
result += v[i];
}
cout << result << endl;
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... | ||||
