oj.uz

Submission #978272

# Submission time Handle Problem Language Result Execution time Memory
978272 2024-05-09T05:11:07 Z wateronenn Stove (JOI18_stove) C++14
100 / 100
 29 ms 3292 KB 
#include<bits/stdc++.h>
#define ll long long
using namespace std;
const int N = 1e5+9;
ll arr[N];
int main(){
    cin.tie(0)->sync_with_stdio(false);
    int n,k;
    cin>>n>>k;
    for(int i=1;i<=n;i++){
        cin>>arr[i];
    }
    
    priority_queue<ll> pq;
    sort(arr+1,arr+n+1);
    ll all = arr[n]+1 - arr[1];
    for(int i=2;i<=n;i++) {
        //cout<<arr[i]-arr[i-1]-1<<" ";
         pq.push(arr[i]-arr[i-1]-1);
    }
    for(int i=1;i<=k-1;i++){
        all-=pq.top();
        pq.pop();
    }
    cout<<all;
    return 0;
}
/*
3 1
1
3
6
*/

Subtask #1
20.0 / 20.0

# 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

Subtask #2
30.0 / 30.0

# 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 1 ms 344 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 344 KB Output is correct
15 Correct 1 ms 348 KB Output is correct

Subtask #3
50.0 / 50.0

# 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 1 ms 344 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 344 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 11 ms 3292 KB Output is correct
17 Correct 11 ms 3292 KB Output is correct
18 Correct 11 ms 3292 KB Output is correct
19 Correct 14 ms 3292 KB Output is correct
20 Correct 18 ms 3292 KB Output is correct
21 Correct 20 ms 3292 KB Output is correct
22 Correct 20 ms 3292 KB Output is correct
23 Correct 20 ms 3292 KB Output is correct
24 Correct 29 ms 3284 KB Output is correct