| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 872069 |
2023-11-12T08:52:57 Z |
I_FloPPed21 |
Stove (JOI18_stove) |
C++14 |
|
38 ms |
2620 KB |
#include <iostream>
#include <bits/stdc++.h>
using namespace std;
long long n, k ;
long long v [ 200005 ];
int main()
{
cin >> n >> k ;
k -- ;
long long sum = 0 ;
priority_queue<int> pq;
for( int i = 1; i <= n ; i ++ )
{
cin >> v[ i ];
if ( i != 1 )
{
sum += ( v[ i ] - v[ i - 1 ] ) ;
pq.push(v [ i ] - v[ i - 1 ] - 1 ) ;
}
//cout << sum<< '\n';
}
sum ++ ;
for ( int i = 1; i <= min(k,n) ; i ++ )
{
sum -= pq.top();
pq.pop();
}
cout << sum << '\n';
return 0;
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
348 KB |
Output is correct |
| 2 |
Correct |
0 ms |
604 KB |
Output is correct |
| 3 |
Correct |
1 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 |
344 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 |
604 KB |
Output is correct |
| 3 |
Correct |
1 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 |
344 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 |
1 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 |
500 KB |
Output is correct |
| 14 |
Correct |
1 ms |
348 KB |
Output is correct |
| 15 |
Correct |
1 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 |
604 KB |
Output is correct |
| 3 |
Correct |
1 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 |
344 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 |
1 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 |
500 KB |
Output is correct |
| 14 |
Correct |
1 ms |
348 KB |
Output is correct |
| 15 |
Correct |
1 ms |
348 KB |
Output is correct |
| 16 |
Correct |
29 ms |
2620 KB |
Output is correct |
| 17 |
Correct |
32 ms |
2512 KB |
Output is correct |
| 18 |
Correct |
29 ms |
2516 KB |
Output is correct |
| 19 |
Correct |
30 ms |
2508 KB |
Output is correct |
| 20 |
Correct |
34 ms |
2500 KB |
Output is correct |
| 21 |
Correct |
37 ms |
2520 KB |
Output is correct |
| 22 |
Correct |
38 ms |
2592 KB |
Output is correct |
| 23 |
Correct |
38 ms |
2476 KB |
Output is correct |
| 24 |
Correct |
38 ms |
2552 KB |
Output is correct |
