| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1179620 | nekolie | Stove (JOI18_stove) | C++20 | 12 ms | 1476 KiB |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0); cout.tie(0);
int n,k; cin >> n >> k;
int a[n], odp;
for (int i = 0; i < n; i++)
cin >> a[i];
odp = a[n-1]-a[0]+1;
vector<int> v;
for (int i = 1; i < n; i++)
v.push_back(a[i]-a[i-1]-1);
sort(v.begin(),v.end());
for (int i = 1; i < k && !v.empty(); i++)
odp -= v.back(), v.pop_back();
cout << odp << 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... | ||||
