# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
66720 | ekrem | Stove (JOI18_stove) | C++98 | 42 ms | 2168 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>
#define st first
#define nd second
#define mp make_pair
#define pb push_back
#define N 1000005
using namespace std;
typedef long long ll;
ll n, m, ind, say, ans, x, a[N], b[N];
int main() {
// freopen("in.txt", "r", stdin);
// freopen("out.txt", "w", stdout);
scanf("%lld %lld",&n ,&m);
for(ll i = 1; i <= n; i++)
scanf("%lld",a + i);
sort(a + 1, a + n + 1);
a[0] = -1;
for(ll i = 1; i <= n; i++)
if(a[i - 1] < a[i] - 1){
if(i != 1)
b[++ind] = a[i] - a[i - 1] - 1;
say++;
}
// cout << say << " " << m << endl;
if(say <= m){
printf("%lld\n",n);
return 0;
}
ans = n;
sort(b + 1, b + ind + 1);
for(; m < say and x <= ind; m++){
ans += b[++x];
// cout << "AMK" << b[x] << endl;
}
printf("%lld\n",ans);
return 0;
}
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... |