제출 #1116925

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1116925		vjudge1	Stove (JOI18_stove)	C++17	0 / 100	1 ms	336 KiB

stove

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define sort undefined_function // To use stable_sort instead sort 
#define bpc __builtin_popcount
#define ull unsigned long long
#define ld double
#define ll long long
#define mp make_pair
#define F first
#define S second

# pragma GCC optimize("O2")
//pragma GCC optimize("my solution")

using namespace __gnu_pbds;
using namespace std;

typedef tree<long long, null_type, less_equal<long long>,
    rb_tree_tag, tree_order_statistics_node_update> Tree;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

const ll INF = 9223372036854775807LL;
const ll inf = 2147483647;
const ll MOD = 1e9 + 7; //[998244353, 1e9 + 7, 1e9 + 13]

ll gcd(ll a, ll b) {return b ? gcd(b, a % b) : a;}
ll lcm(ll a, ll b) {return a * b / gcd(a, b);}
ll ceil(ll a, ll b) {return (a + b - 1) / b;}

int32_t main() {
        ios_base::sync_with_stdio(0);
        cin.tie(0);

        int n, k;
        cin >> n >> k;

        vector<int> v(n + 1);

        for (int i = 1; i <= n; i ++) 
                cin >> v[i];

        vector<int> aux;
        aux.push_back(1);

        for (int i = 1; i < n; i ++) {
                aux.push_back(v[i + 1] - v[i] - 1);
                aux.push_back(1);
        }

        k --;
        stable_sort(aux.begin(), aux.end());

        for (auto &x : aux)
                cerr << x << " ";
        cerr << "\n";

        while (k --) 
                aux.pop_back();

        ll ans = 0;
        for (auto &x : aux)
                ans += x;
        cout << ans << '\n';


        return 0;
}

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