| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 1003758 |
2024-06-20T16:52:26 Z |
codexistent |
Stove (JOI18_stove) |
C++14 |
|
61 ms |
6484 KB |
#include <iostream>
#include <set>
#include <algorithm>
using namespace std;
#define MAXN 100005
#define FOR(i, a, b) for(int i = a; i <= b; i++)
int n, m, arr[MAXN];
int main(){
cin >> n >> m;
FOR(i, 1, n) cin >> arr[i];
sort(arr + 1, arr + 1 + n);
multiset<int> s;
FOR(i, 1, n - 1) s.insert(arr[i + 1] - arr[i] - 1);
int res = arr[n] - arr[1] + 1;
m = (m == 0) ? 0 : m - 1;
while(s.size() && m){
res -= *(s.rbegin());
s.erase(s.find(*(s.rbegin())));
m--;
}
cout << res << endl;
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
348 KB |
Output is correct |
| 2 |
Correct |
0 ms |
348 KB |
Output is correct |
| 3 |
Correct |
0 ms |
348 KB |
Output is correct |
| 4 |
Correct |
0 ms |
348 KB |
Output is correct |
| 5 |
Correct |
0 ms |
348 KB |
Output is correct |
| 6 |
Correct |
0 ms |
348 KB |
Output is correct |
| 7 |
Correct |
0 ms |
348 KB |
Output is correct |
| 8 |
Correct |
0 ms |
348 KB |
Output is correct |
| 9 |
Correct |
0 ms |
348 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
348 KB |
Output is correct |
| 2 |
Correct |
0 ms |
348 KB |
Output is correct |
| 3 |
Correct |
0 ms |
348 KB |
Output is correct |
| 4 |
Correct |
0 ms |
348 KB |
Output is correct |
| 5 |
Correct |
0 ms |
348 KB |
Output is correct |
| 6 |
Correct |
0 ms |
348 KB |
Output is correct |
| 7 |
Correct |
0 ms |
348 KB |
Output is correct |
| 8 |
Correct |
0 ms |
348 KB |
Output is correct |
| 9 |
Correct |
0 ms |
348 KB |
Output is correct |
| 10 |
Correct |
2 ms |
604 KB |
Output is correct |
| 11 |
Correct |
2 ms |
856 KB |
Output is correct |
| 12 |
Correct |
1 ms |
604 KB |
Output is correct |
| 13 |
Correct |
1 ms |
604 KB |
Output is correct |
| 14 |
Correct |
1 ms |
604 KB |
Output is correct |
| 15 |
Correct |
1 ms |
484 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
348 KB |
Output is correct |
| 2 |
Correct |
0 ms |
348 KB |
Output is correct |
| 3 |
Correct |
0 ms |
348 KB |
Output is correct |
| 4 |
Correct |
0 ms |
348 KB |
Output is correct |
| 5 |
Correct |
0 ms |
348 KB |
Output is correct |
| 6 |
Correct |
0 ms |
348 KB |
Output is correct |
| 7 |
Correct |
0 ms |
348 KB |
Output is correct |
| 8 |
Correct |
0 ms |
348 KB |
Output is correct |
| 9 |
Correct |
0 ms |
348 KB |
Output is correct |
| 10 |
Correct |
2 ms |
604 KB |
Output is correct |
| 11 |
Correct |
2 ms |
856 KB |
Output is correct |
| 12 |
Correct |
1 ms |
604 KB |
Output is correct |
| 13 |
Correct |
1 ms |
604 KB |
Output is correct |
| 14 |
Correct |
1 ms |
604 KB |
Output is correct |
| 15 |
Correct |
1 ms |
484 KB |
Output is correct |
| 16 |
Correct |
46 ms |
6224 KB |
Output is correct |
| 17 |
Correct |
57 ms |
6460 KB |
Output is correct |
| 18 |
Correct |
61 ms |
6348 KB |
Output is correct |
| 19 |
Correct |
54 ms |
6484 KB |
Output is correct |
| 20 |
Correct |
48 ms |
6224 KB |
Output is correct |
| 21 |
Correct |
54 ms |
6464 KB |
Output is correct |
| 22 |
Correct |
53 ms |
6228 KB |
Output is correct |
| 23 |
Correct |
54 ms |
6228 KB |
Output is correct |
| 24 |
Correct |
53 ms |
6224 KB |
Output is correct |
