oj.uz

Submission #958821

# Submission time Handle Problem Language Result Execution time Memory
958821 2024-04-06T22:41:40 Z sopaconk Stove (JOI18_stove) C++17
100 / 100
 20 ms 2520 KB 
/*
    Sopaconk  6/04/23
*/

#include <bits/stdc++.h>
#define f first
#define s second
#define pb push_back
#define deb(x) cout<<#x<<": "<<(x)<<endl
using lli=long long int;
//using pii=pair<int,int>;
using ld=long double;
lli MOD=1e9+7;

using namespace std;

#define endl '\n'

void solve(){
    lli n,k;
    cin>>n>>k;
    vector<lli> v (n);
    for(lli i=0; i<n; ++i){
        cin>>v[i];
    }
    lli aux=n;
    priority_queue<lli, vector<lli>, greater<lli>> pq;
    for(lli i=1; i<n; ++i){
        pq.push(v[i]-v[i-1]-1);
    }
    lli ans=n;
    while(aux>k){
        ans+=pq.top();
        pq.pop();
        aux--;
    }
    cout<<ans<<endl;
}

int main(){
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int t=1;
//cin>>t;
while(t--){
    solve();
}
}

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 348 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 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 20 ms 2264 KB Output is correct
17 Correct 20 ms 2268 KB Output is correct
18 Correct 18 ms 2268 KB Output is correct
19 Correct 18 ms 2264 KB Output is correct
20 Correct 14 ms 2268 KB Output is correct
21 Correct 14 ms 2264 KB Output is correct
22 Correct 10 ms 2520 KB Output is correct
23 Correct 9 ms 2264 KB Output is correct
24 Correct 10 ms 2268 KB Output is correct