| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1290538 | lukaye_19 | Stove (JOI18_stove) | C++20 | 36 ms | 2340 KiB |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int N,K; cin >> N >> K;
vector<long long>guests(N);
for (int i = 0; i < N; i++) cin >> guests[i];
vector<long long>gaps;
for (int i = 0; i < N - 1; i++)
{
int gap = guests[i + 1] - guests[i];
gaps.push_back(gap);
}
sort(gaps.begin(),gaps.end());
int total = K;
for (int i = 0; i < N - K; i++)
{
total += gaps[i];
}
cout << total << endl;
}| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
