이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define fastio ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define nl "\n"
#define inf LONG_LONG_MAX
#define show(x); cerr << #x << " is " << x << nl;
#define show2(x,y); cerr << #x << " is " << x << " " << #y << " is " << y << nl;
#define show3(x,y,z); cerr << #x << " is " << x << " " << #y << " is " << y << " " << #z << " is " << z << nl;
#define showall(x); cerr << #x << " is "; for (auto i : x) {cerr << i << " ";} cerr << nl;
signed main(){
fastio
int n, k;
cin >> n >> k;
int t[n];
for (int i=0; i<n; i++) cin >> t[i];
sort(t, t+n);
vector<int> gaps;
for (int i=1; i<n; i++) gaps.push_back(t[i]-t[i-1]-1);
sort(gaps.begin(), gaps.end());
int sum = n;
for (int i=0; i<n-k; i++) sum += gaps[i];
cout << sum << nl;
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... |