| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1241946 | tavtdaz | Stove (JOI18_stove) | C++20 | 33 ms | 9152 KiB |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
int main () {
ll n,t[1000001],k,kq=0;
cin>>n>>k;
for(int i=1;i<=n;i++) cin>>t[i];
sort(t+1,t+n+1);
vector<ll> gap;
for(int i=1;i<=n;i++) {
gap.push_back(t[i+1]-t[i]-1);
}
ll s=t[n]+1-t[1];
sort(gap.begin(),gap.end(),greater<ll>());
ll skip=min(k-1,(ll)gap.size());
for(int i=0;i<skip;i++) {
s-=gap[i];
}
cout<<s;
}| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
