| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 498289 |
2021-12-24T19:57:10 Z |
OrazB |
Stove (JOI18_stove) |
C++14 |
|
29 ms |
4528 KB |
#include <bits/stdc++.h>
#define N 100005
#define ll long long int
#define pii pair <long long, long long>
#define pb push_back
#define ff first
#define ss second
using namespace std;
ll n, k, ans, a[N], m[N];
vector <pii> v;
int main ()
{
ios::sync_with_stdio(false);
cin.tie(0);
cin >> n >> k;
if (n == 1) return cout << 1, 0;
for (int i = 1; i <= n; i++) cin >> a[i];
sort(a + 1, a + n + 1);
for (int i = 1; i < n; i++) v.pb({a[i + 1] - a[i], i});
sort(v.begin(), v.end());
reverse(v.begin(), v.end());
for (int i = 0; i < k - 1; i++) m[v[i].ss] = 1;
for (int i = 2; i <= n; i++){
if (i == 2){
if (m[i - 1]) ans += 2;
else ans += a[i] - a[i - 1] + 1;
continue;
}
if (m[i - 1]) ans++;
else ans += a[i] - a[i - 1];
}
cout << ans;
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
204 KB |
Output is correct |
| 2 |
Correct |
0 ms |
204 KB |
Output is correct |
| 3 |
Correct |
0 ms |
204 KB |
Output is correct |
| 4 |
Correct |
0 ms |
204 KB |
Output is correct |
| 5 |
Correct |
0 ms |
204 KB |
Output is correct |
| 6 |
Correct |
0 ms |
204 KB |
Output is correct |
| 7 |
Correct |
0 ms |
204 KB |
Output is correct |
| 8 |
Correct |
0 ms |
204 KB |
Output is correct |
| 9 |
Correct |
0 ms |
204 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
204 KB |
Output is correct |
| 2 |
Correct |
0 ms |
204 KB |
Output is correct |
| 3 |
Correct |
0 ms |
204 KB |
Output is correct |
| 4 |
Correct |
0 ms |
204 KB |
Output is correct |
| 5 |
Correct |
0 ms |
204 KB |
Output is correct |
| 6 |
Correct |
0 ms |
204 KB |
Output is correct |
| 7 |
Correct |
0 ms |
204 KB |
Output is correct |
| 8 |
Correct |
0 ms |
204 KB |
Output is correct |
| 9 |
Correct |
0 ms |
204 KB |
Output is correct |
| 10 |
Correct |
1 ms |
460 KB |
Output is correct |
| 11 |
Correct |
1 ms |
460 KB |
Output is correct |
| 12 |
Correct |
1 ms |
460 KB |
Output is correct |
| 13 |
Correct |
1 ms |
460 KB |
Output is correct |
| 14 |
Correct |
1 ms |
460 KB |
Output is correct |
| 15 |
Correct |
1 ms |
460 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
204 KB |
Output is correct |
| 2 |
Correct |
0 ms |
204 KB |
Output is correct |
| 3 |
Correct |
0 ms |
204 KB |
Output is correct |
| 4 |
Correct |
0 ms |
204 KB |
Output is correct |
| 5 |
Correct |
0 ms |
204 KB |
Output is correct |
| 6 |
Correct |
0 ms |
204 KB |
Output is correct |
| 7 |
Correct |
0 ms |
204 KB |
Output is correct |
| 8 |
Correct |
0 ms |
204 KB |
Output is correct |
| 9 |
Correct |
0 ms |
204 KB |
Output is correct |
| 10 |
Correct |
1 ms |
460 KB |
Output is correct |
| 11 |
Correct |
1 ms |
460 KB |
Output is correct |
| 12 |
Correct |
1 ms |
460 KB |
Output is correct |
| 13 |
Correct |
1 ms |
460 KB |
Output is correct |
| 14 |
Correct |
1 ms |
460 KB |
Output is correct |
| 15 |
Correct |
1 ms |
460 KB |
Output is correct |
| 16 |
Correct |
23 ms |
4164 KB |
Output is correct |
| 17 |
Correct |
22 ms |
4200 KB |
Output is correct |
| 18 |
Correct |
25 ms |
4368 KB |
Output is correct |
| 19 |
Correct |
22 ms |
4444 KB |
Output is correct |
| 20 |
Correct |
23 ms |
4528 KB |
Output is correct |
| 21 |
Correct |
23 ms |
4480 KB |
Output is correct |
| 22 |
Correct |
22 ms |
4440 KB |
Output is correct |
| 23 |
Correct |
25 ms |
4504 KB |
Output is correct |
| 24 |
Correct |
29 ms |
4440 KB |
Output is correct |
