| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1333571 | sporknives | Stove (JOI18_stove) | C++20 | 37 ms | 2328 KiB |
#include <bits/stdc++.h>
#define int long long
using namespace std;
typedef pair<int,int> pii;
signed main() {
int n,k; cin>>n>>k;
int a[n]; for(int i=0;i<n;i++) cin>>a[i];
vector<int> gaps;
for(int i=0;i<n-1;i++) {
gaps.push_back(a[i+1]-a[i]-1);
}
sort(gaps.begin(),gaps.end(),greater<int>());
int ans=0;
for(int i=0;i<k-1;i++) {
ans+=gaps[i];
}
ans = a[n-1]-a[0]+1-ans;
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... | ||||
