| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1179467 | orgiloogii | Stove (JOI18_stove) | C++20 | 11 ms | 1476 KiB |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
int n, k;
cin >> n >> k;
int t[n];
vector <int> df;
for (int i = 0;i < n;i++) {
cin >> t[i];
}
for (int i = 1;i < n;i++) {
df.push_back(t[i] - t[i - 1]);
}
sort(df.begin(), df.end());
int ans = 0;
for (int i = 0;i < n - k;i++) {
ans += df[i];
}
cout << ans + k << 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... | ||||
