oj.uz

답안 #1033688

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1033688 2024-07-25T04:15:40 Z vjudge1 Stove (JOI18_stove) C++17
100 / 100
 14 ms 2140 KB 
#include<bits/stdc++.h>

using namespace std;
#define int long long
int n, a[100005], k;
void solve() {
    cin >> n >> k;
    vector<int> v;
    for (int i = 1; i <= n; i++) {
        cin >> a[i];
        if(i > 1) v.push_back(a[i]-a[i-1]);
    }
    int res = a[n]-a[1]+k;
    sort(v.begin(), v.end(), greater<>());
    k--;
    for (int i = 0; i < k; i++) res -= v[i];
    cout << res;
}

signed 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 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

# 결과 실행 시간 메모리 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 0 ms 348 KB Output is correct
11 Correct 1 ms 552 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

# 결과 실행 시간 메모리 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 0 ms 348 KB Output is correct
11 Correct 1 ms 552 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 14 ms 2012 KB Output is correct
17 Correct 13 ms 2012 KB Output is correct
18 Correct 13 ms 2012 KB Output is correct
19 Correct 13 ms 2140 KB Output is correct
20 Correct 13 ms 2008 KB Output is correct
21 Correct 12 ms 2108 KB Output is correct
22 Correct 12 ms 2008 KB Output is correct
23 Correct 13 ms 2008 KB Output is correct
24 Correct 13 ms 2008 KB Output is correct