| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 990101 |
2024-05-29T15:09:28 Z |
Newtonabc |
Stove (JOI18_stove) |
C++14 |
|
35 ms |
2408 KB |
#include<bits/stdc++.h>
using namespace std;
const int N=1e5+10;
int arr[N];
priority_queue<int> q;
int main(){
int n,m,ans,prev;
cin>>n >>m;
for(int i=1;i<=n;i++) cin>>arr[i];
prev=arr[1];
for(int i=2;i<=n;i++){
q.push(arr[i]-prev-1);
prev=arr[i];
}
ans=arr[n]-arr[1]+1;
int cnt=1;
while(cnt<m){
ans-=q.top();
q.pop();
cnt++;
}
cout<<ans;
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
344 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 |
344 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 |
344 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 |
344 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 |
456 KB |
Output is correct |
| 13 |
Correct |
2 ms |
348 KB |
Output is correct |
| 14 |
Correct |
2 ms |
348 KB |
Output is correct |
| 15 |
Correct |
2 ms |
348 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
344 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 |
344 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 |
456 KB |
Output is correct |
| 13 |
Correct |
2 ms |
348 KB |
Output is correct |
| 14 |
Correct |
2 ms |
348 KB |
Output is correct |
| 15 |
Correct |
2 ms |
348 KB |
Output is correct |
| 16 |
Correct |
26 ms |
2264 KB |
Output is correct |
| 17 |
Correct |
25 ms |
2408 KB |
Output is correct |
| 18 |
Correct |
26 ms |
2196 KB |
Output is correct |
| 19 |
Correct |
26 ms |
2260 KB |
Output is correct |
| 20 |
Correct |
31 ms |
2224 KB |
Output is correct |
| 21 |
Correct |
32 ms |
2264 KB |
Output is correct |
| 22 |
Correct |
35 ms |
2256 KB |
Output is correct |
| 23 |
Correct |
33 ms |
2256 KB |
Output is correct |
| 24 |
Correct |
33 ms |
2388 KB |
Output is correct |
