| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1333562 | enson | Stove (JOI18_stove) | C++20 | 27 ms | 2364 KiB |
#include <bits/stdc++.h>
using namespace std;
#define int long long
signed main(){
ios_base::sync_with_stdio(false);
cin.tie(0);
int N, K;
cin >> N >> K;
int T[N];
for(int i = 0; i < N; i++){
cin >> T[i];
}
priority_queue<int>pq;
for(int i = 0; i < N-1; i++){
pq.push(T[i+1]-T[i]-1);
}
for(int i = 0; i < K-1; i++){
pq.pop();
}
int a = N;
while(!pq.empty()){
a += pq.top();
pq.pop();
}
cout << a;
}
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
