Submission #319601

#	Time	Username	Problem	Language	Result	Execution time	Memory
319601		Gilgamesh	Stove (JOI18_stove)	C++17	100 / 100	27 ms	2416 KiB

stove

#include <bits/stdc++.h>
//#include <bits/extc++.h>
//#include <ext/pb_ds/assoc_container.hpp> // Common file
//#include <ext/pb_ds/tree_policy.hpp> // Including tree_order_statistics_node_update
 
using namespace std;
//using namespace __gnu_pbds;
//template<typename T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
 
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using ull = unsigned ll;
 
#define pb push_back
#define mp make_pair
#define eb emplace_back
#define all(x) (x).begin(),(x).end()
#define x first
#define y second

//const int MOD = 1e9 + 7;
const int MOD = 998244353;
const int dx[] = {0, 0, 1, -1};
const int dy[] = {1, -1, 0, 0}; 
const char dir[] = {'R', 'L', 'D', 'U'};
 
int add(int a, int b){ //(a + b) % 1e9 + 7
    a += b;
    if(a < 0){
        a += MOD;
    }
    if(a >= MOD){
        a -= MOD;
    }
    return a;
}
 
int sub(int a, int b){
    a -= b;
    if(a < 0) a += MOD;
    return a;
}
 
int mult(int a, int b){
    return ((ll) a * b) % MOD;
}
 
void setIO() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
//    freopen((s+".in").c_str(),"r",stdin);
//    freopen((s+".text").c_str(),"w",stdout);
}

signed main(){
    setIO();
    //CHECK FOR LONG LONG!!!
    //LONG LONG OVERFLOW??
    int n, k; cin >> n >> k;
    int a[n];
    for(int i = 0; i < n; ++i){
    	cin >> a[i];
    }
    sort(a, a + n);
    int ans = a[n - 1] + 1 - a[0];
    vector<int> diffs;
    for(int i = 1; i < n; ++i){
    	diffs.eb(a[i] - (a[i - 1] + 1));
    }
    sort(all(diffs), greater<int>());
    for(int i = 0; i < k - 1; ++i){
    	ans -= diffs[i];
    }
    cout << ans << "\n";
    //CHECK FOR LONG LONG!!!
}

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