제출 #1293524

#제출 시각아이디문제언어결과실행 시간메모리
1293524fairkrashStove (JOI18_stove)C++20
100 / 100
14 ms2376 KiB
#include <bits/stdc++.h>

#include <random>

using namespace std;
using ll = long long;
using ld = long double;

ll INF = 1e18 + 10;

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(nullptr);
    ll n, k;
    cin >> n >> k;
    k--;
    vector<ll> s(n);
    ll def = n;
    for (ll i = 0; i < n; i++) {
        cin >> s[i];
    }
    vector<ll> mx;
    for (ll i = 0; i < n - 1; i++) {
        mx.push_back(s[i + 1] - s[i] - 1);
    }
    sort(mx.rbegin(), mx.rend());
    for (ll i = k; i < mx.size(); i++) {
        def += mx[i];
    }
    cout << def;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...