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