| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1333585 | WongYiKai | Stove (JOI18_stove) | C++20 | 39 ms | 1552 KiB |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
ll n,k;
cin >> n >> k;
k--;
ll init;
cin >> init;
vector<ll> diff;
ll prev = init;
ll ans = 1;
for (int i=1;i<n;i++){
ll t;
cin >> t;
diff.push_back(t-prev-1);
if (i==n-1) ans = t-init+1;
prev = t;
}
sort(diff.begin(),diff.end(),greater<>());
for (int i=0;i<k;i++) ans -= diff[i];
cout << ans;
}| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
