답안 #1099109

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1099109 2024-10-10T14:49:42 Z imanghader Stove (JOI18_stove) C++17
100 / 100
16 ms 3292 KB
#include <bits/stdc++.h>
#if __has_include("prettyprint.hpp")
#include "prettyprint.hpp"
#endif
using namespace std;

#define ll long long
#define all(v) v.begin(), v.end()
#define watch(x) cout << (#x) << " is " << (x) << endl
#define mk make_pair

struct solve {
    void main() {
        ll n,k;cin>>n>>k;
        vector<ll> v(n);
        for (ll i=0;i<n;i++){
            cin>>v[i];
        }
        vector<ll> a;
        for (ll i=0;i<n-1;i++){
            a.push_back(v[i+1]-v[i]-1);
        }
        sort(all(a));
        reverse(all(a));
        ll ans=v[n-1]-v[0]+1;
        for (ll i=0;i<k-1;i++){
            ans-=a[i];
        }
        cout<<ans<<endl;
    }
};

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    ll t=1;
    /* cin >> t; */
    while (t--) {
        solve s;
        s.main();
    }
    return 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
# 결과 실행 시간 메모리 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 1 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 344 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 1 ms 572 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
# 결과 실행 시간 메모리 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 1 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 344 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 1 ms 572 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 16 ms 3292 KB Output is correct
17 Correct 14 ms 3288 KB Output is correct
18 Correct 14 ms 3292 KB Output is correct
19 Correct 14 ms 3288 KB Output is correct
20 Correct 14 ms 3288 KB Output is correct
21 Correct 14 ms 3280 KB Output is correct
22 Correct 14 ms 3292 KB Output is correct
23 Correct 14 ms 3288 KB Output is correct
24 Correct 15 ms 3292 KB Output is correct