제출 #1305992

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1305992		arafatistic	Stove (JOI18_stove)	C++20	100 / 100	14 ms	2244 KiB

stove

#include <bits/stdc++.h>
// #pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math,O3")
// #pragma GCC optimize("Ofast")
// #pragma GCC target("avx,avx2,fma")
// #pragma GCC optimization("unroll-loops")
// #pragma ("reroll")
#define all(v) v.begin(), v.end()
#define skip continue;
#define gold ios_base::sync_with_stdio(false);cin.tie(NULL);
#define xa "\n"
#define int long long
#define pb push_back
#define S second
#define F first

using namespace std;

const int mod = 1e9 + 7;
const int N = 1e6 + 7;
const int MAX = 1e9;
const int inf = 1e18;

int gcd(int a, int b) { if (b == 0) return a; else if(a == 0) return b; else return gcd(b, a % b); }
int lcm(int a, int b) { return a / gcd(a, b) * b; }

void solve() {
    int n, k;
    cin >> n >> k;
    int a[n + 1];
    vector < int > gap;
    for(int i = 1; i <= n; i++){
        cin >> a[i];
        if(i != 1){
            gap.pb(a[i] - a[i - 1] - 1);
        }
    }
    int ans = a[n] - a[1] + 1;
    sort(all(gap));
    reverse(all(gap));
    for(int i = 0; i < k - 1; i++){
        ans -= gap[i];
    }
    cout << ans;
}

signed main() {
    gold;
    //freopen("knight.in", "r", stdin);
    //freopen("knight.out", "w", stdout);
    int t = 1;
    int tt = 0;
    //cin >> t;
    while (t--) {
        tt++;
        //cout << "Case " << tt << ":" << xa;
        solve();
    }
}


    

• Subtask 1: 20 / 20
• Subtask 2: 30 / 30
• Subtask 3: 50 / 50