oj.uz

답안 #937488

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
937488 2024-03-04T06:59:07 Z carriewang Stove (JOI18_stove) C++17
100 / 100
 19 ms 4828 KB 
#include <bits/stdc++.h>
#define ll long long
#define vi vector<int>
#define pll pait<ll,ll>
#define sz(x) x.size()
#define all(x) x.begin(),x.end()
#define F first
#define S second
using namespace std;
priority_queue<ll> pq;
ll a[1000005],n,k,ans;
int main(){
    ios::sync_with_stdio(0),cin.tie(0);
    cin >> n >> k;
    k--;
    for(int i=0;i<n;i++){
        cin >> a[i];
    }
    ans=a[n-1]-a[0]+1;
    for(int i=1;i<n;i++) pq.emplace(a[i]-a[i-1]-1);
    while(k--){
        ans-=pq.top();
        pq.pop();
    }
    cout << ans << "\n";
}

Subtask #1
20.0 / 20.0

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

Subtask #2
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 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 1 ms 344 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 460 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 396 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 1 ms 508 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 600 KB Output is correct

Subtask #3
50.0 / 50.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 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 1 ms 344 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 460 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 396 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 1 ms 508 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 600 KB Output is correct
16 Correct 10 ms 4828 KB Output is correct
17 Correct 10 ms 4828 KB Output is correct
18 Correct 10 ms 4724 KB Output is correct
19 Correct 12 ms 4828 KB Output is correct
20 Correct 15 ms 4632 KB Output is correct
21 Correct 19 ms 4824 KB Output is correct
22 Correct 19 ms 4828 KB Output is correct
23 Correct 19 ms 4724 KB Output is correct
24 Correct 19 ms 4828 KB Output is correct