| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1163092 | boclobanchat | Stove (JOI18_stove) | C++20 | 12 ms | 1096 KiB |
#include<bits/stdc++.h>
using namespace std;
const int MAXN=1e5+5;
int D[MAXN],A[MAXN];
int main()
{
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int n,k;
cin>>n>>k;
for(int i=1;i<=n;i++) cin>>A[i];
sort(A+1,A+n+1);
for(int i=1;i<n;i++) D[i]=A[i+1]-A[i];
sort(D+1,D+n,greater<int>());
int ans=A[n]-A[1]+1;
for(int i=1;i<k;i++) ans-=D[i]-1;
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... | ||||
