답안 #768835

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
768835 2023-06-28T18:00:23 Z dimashhh Stove (JOI18_stove) C++17
100 / 100
35 ms 6760 KB
#include <bits/stdc++.h>
 
using namespace std;

typedef long long ll;

const int N = 1e6 + 123,MOD = 1e9 + 7;

int n,k;
ll a[N],dp[5100][5100],mn[5100];
void test(){
    cin >> n >> k;
    for(int i = 1;i <= n;i++){
        cin >> a[i];
    }                                                                           
    k--;
    multiset<ll> st;
    ll res = (a[n] - a[1] + 1);
    for(int i = 1;i < n;i++){
        st.insert(abs(a[i] - a[i + 1]) - 1);
    }
    while(k--){
        ll val = (*st.rbegin());
        res -= val;
        st.erase(st.find(*st.rbegin()));
        //cout << val << '\n';
    }
    cout << res;
}
int main(){
    cin.tie(0);ios_base::sync_with_stdio(0);
    int T = 1;
    // cin >> T;
    while(T--){
        test();
    }
}


# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 1 ms 468 KB Output is correct
11 Correct 1 ms 468 KB Output is correct
12 Correct 1 ms 468 KB Output is correct
13 Correct 1 ms 468 KB Output is correct
14 Correct 1 ms 468 KB Output is correct
15 Correct 1 ms 468 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 1 ms 468 KB Output is correct
11 Correct 1 ms 468 KB Output is correct
12 Correct 1 ms 468 KB Output is correct
13 Correct 1 ms 468 KB Output is correct
14 Correct 1 ms 468 KB Output is correct
15 Correct 1 ms 468 KB Output is correct
16 Correct 27 ms 5716 KB Output is correct
17 Correct 27 ms 6712 KB Output is correct
18 Correct 27 ms 6740 KB Output is correct
19 Correct 35 ms 6760 KB Output is correct
20 Correct 31 ms 6720 KB Output is correct
21 Correct 30 ms 6668 KB Output is correct
22 Correct 30 ms 6704 KB Output is correct
23 Correct 31 ms 6740 KB Output is correct
24 Correct 31 ms 6756 KB Output is correct