| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 916471 |
2024-01-26T01:28:02 Z |
vjudge1 |
Stove (JOI18_stove) |
C++11 |
|
44 ms |
2380 KB |
#include <bits/stdc++.h>
using namespace std;
int N, K, A[100100], ans;
vector<int> v;
int main()
{
cin >> N >> K;
for(int i=1; i<=N; i++) {
cin >> A[i];
}
sort(A+1, A+N+1);
for(int i=1; i<N; i++) {
if (A[i+1] > A[i]+1) {
v.push_back(A[i+1]-A[i]-1);
}
}
sort(v.begin(), v.end(), greater<int>());
for(int i=0; i<min(K-1,(int)v.size()); i++) {
ans += v[i];
}
cout << A[N]-A[1]+1-ans << endl;
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
344 KB |
Output is correct |
| 2 |
Correct |
1 ms |
344 KB |
Output is correct |
| 3 |
Correct |
1 ms |
448 KB |
Output is correct |
| 4 |
Correct |
1 ms |
348 KB |
Output is correct |
| 5 |
Correct |
1 ms |
440 KB |
Output is correct |
| 6 |
Correct |
1 ms |
348 KB |
Output is correct |
| 7 |
Correct |
0 ms |
348 KB |
Output is correct |
| 8 |
Correct |
1 ms |
348 KB |
Output is correct |
| 9 |
Correct |
0 ms |
348 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
344 KB |
Output is correct |
| 2 |
Correct |
1 ms |
344 KB |
Output is correct |
| 3 |
Correct |
1 ms |
448 KB |
Output is correct |
| 4 |
Correct |
1 ms |
348 KB |
Output is correct |
| 5 |
Correct |
1 ms |
440 KB |
Output is correct |
| 6 |
Correct |
1 ms |
348 KB |
Output is correct |
| 7 |
Correct |
0 ms |
348 KB |
Output is correct |
| 8 |
Correct |
1 ms |
348 KB |
Output is correct |
| 9 |
Correct |
0 ms |
348 KB |
Output is correct |
| 10 |
Correct |
2 ms |
348 KB |
Output is correct |
| 11 |
Correct |
1 ms |
348 KB |
Output is correct |
| 12 |
Correct |
1 ms |
348 KB |
Output is correct |
| 13 |
Correct |
1 ms |
348 KB |
Output is correct |
| 14 |
Correct |
1 ms |
348 KB |
Output is correct |
| 15 |
Correct |
2 ms |
604 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
344 KB |
Output is correct |
| 2 |
Correct |
1 ms |
344 KB |
Output is correct |
| 3 |
Correct |
1 ms |
448 KB |
Output is correct |
| 4 |
Correct |
1 ms |
348 KB |
Output is correct |
| 5 |
Correct |
1 ms |
440 KB |
Output is correct |
| 6 |
Correct |
1 ms |
348 KB |
Output is correct |
| 7 |
Correct |
0 ms |
348 KB |
Output is correct |
| 8 |
Correct |
1 ms |
348 KB |
Output is correct |
| 9 |
Correct |
0 ms |
348 KB |
Output is correct |
| 10 |
Correct |
2 ms |
348 KB |
Output is correct |
| 11 |
Correct |
1 ms |
348 KB |
Output is correct |
| 12 |
Correct |
1 ms |
348 KB |
Output is correct |
| 13 |
Correct |
1 ms |
348 KB |
Output is correct |
| 14 |
Correct |
1 ms |
348 KB |
Output is correct |
| 15 |
Correct |
2 ms |
604 KB |
Output is correct |
| 16 |
Correct |
35 ms |
2380 KB |
Output is correct |
| 17 |
Correct |
35 ms |
2256 KB |
Output is correct |
| 18 |
Correct |
44 ms |
2256 KB |
Output is correct |
| 19 |
Correct |
36 ms |
2300 KB |
Output is correct |
| 20 |
Correct |
35 ms |
2252 KB |
Output is correct |
| 21 |
Correct |
35 ms |
2316 KB |
Output is correct |
| 22 |
Correct |
37 ms |
2200 KB |
Output is correct |
| 23 |
Correct |
38 ms |
2252 KB |
Output is correct |
| 24 |
Correct |
36 ms |
2376 KB |
Output is correct |
