oj.uz

답안 #916482

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
916482 2024-01-26T01:55:53 Z vjudge1 Stove (JOI18_stove) C++17
100 / 100
 47 ms 2944 KB 
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define pob pop_back
#define pf push_front
#define pof pop_front
#define pii pair<int, int>
#define pll pair<ll, ll>
#define ld long double
#define fastio ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
#define elif else if
#define x first
#define y second
ll n, k, t[100001], dist[100001], ans;

int main(){
    cin >> n >> k;
    for(int i=1; i<=n; i++){
        cin >> t[i];
    }
    for(int i=2; i<=n; i++){
        dist[i]=t[i]-t[i-1];
    }
    sort(dist+2, dist+n+1, greater<ll>());
    ans=t[n]-t[1]+1;
    for(int i=2; i<=n && k>1; i++, k--){
        ans-=dist[i]-1;
    }
    cout << ans << endl;
}

Subtask #1
20.0 / 20.0

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

Subtask #3
50.0 / 50.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 600 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 2 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 2 ms 348 KB Output is correct
14 Correct 2 ms 348 KB Output is correct
15 Correct 2 ms 344 KB Output is correct
16 Correct 34 ms 2884 KB Output is correct
17 Correct 34 ms 2944 KB Output is correct
18 Correct 47 ms 2908 KB Output is correct
19 Correct 43 ms 2896 KB Output is correct
20 Correct 34 ms 2908 KB Output is correct
21 Correct 34 ms 2900 KB Output is correct
22 Correct 38 ms 2924 KB Output is correct
23 Correct 34 ms 2832 KB Output is correct
24 Correct 36 ms 2908 KB Output is correct