oj.uz

답안 #958820

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
958820 2024-04-06T22:41:24 Z vjudge1 Stove (JOI18_stove) C++17
100 / 100
 22 ms 3292 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

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 360 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 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 452 KB Output is correct

Subtask #2
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 360 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 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 452 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 512 KB Output is correct
14 Correct 1 ms 464 KB Output is correct
15 Correct 1 ms 344 KB Output is correct

Subtask #3
50.0 / 50.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 360 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 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 452 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 512 KB Output is correct
14 Correct 1 ms 464 KB Output is correct
15 Correct 1 ms 344 KB Output is correct
16 Correct 20 ms 3288 KB Output is correct
17 Correct 19 ms 3292 KB Output is correct
18 Correct 20 ms 3292 KB Output is correct
19 Correct 22 ms 3288 KB Output is correct
20 Correct 15 ms 3288 KB Output is correct
21 Correct 13 ms 3292 KB Output is correct
22 Correct 10 ms 3292 KB Output is correct
23 Correct 10 ms 3288 KB Output is correct
24 Correct 15 ms 3292 KB Output is correct