# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
657718 | _Knyaz_ | Stove (JOI18_stove) | C++17 | 19 ms | 2844 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define int ll
#define all(x) (x).begin(),(x).end()
const int mod = 1e9+7;
const double PI = acos( -1. );
void in(){
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
}
int fenwick(vector<int> &vec, int i){
int sum = 0;
while(i > 0){
sum += vec[i];
i -= i & -i;
}
return sum;
}
void solve(){
//in();
int n, k; cin >> n >> k;
vector<int> vec(n), ans(n - 1);
for(auto &x:vec) cin >> x;
sort(all(vec));
for(int i = 1; i < n; i++) ans[i-1] = vec[i] - vec[i-1] - 1;
sort(all(ans));
int res = vec[n-1] - vec[0] + 1;
for(int i = n - 2; i > n - k - 1; i--) res -= ans[i];
cout << res;
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |