제출 #1137026

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

stove

/*

author: CRISTIANO RONALDO

#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
typedef tree<int,null_type,less<int>,rb_tree_tag,
tree_order_statistics_node_update> indexed_set;
can do: find_by_order, order_of_key

__builtin_clz(x): the number of zeros at the beginning of the number
__builtin_ctz(x): the number of zeros at the end of the number
__builtin_popcount(x): the number of ones in the number
__builtin_parity(x): the parity (even or odd) of the number of ones

mt19937 rng(16);
mt19937 bruh(chrono::steady_clock::now().time_since_epoch().count());
mt19937_64 rofl(chrono::steady_clock::now().time_since_epoch().count());
*/
#include <bits/stdc++.h>
#define all(a) a.begin(), a.end()
#define F first
#define S second
#define pb push_back
#define lv v+v
#define rv v+v+1
#define files freopen("aa.txt", "r", stdin), freopen("aa.txt", "w", stdout)
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
using pll = pair <long long, long long>;
using pii = pair <int,int>;
#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("O3")
long long mod = 998244353;
const ll N = 1e5 + 10;
const ll M = 7e3 + 10;
const ll P = 311;
const ld EPS = 1e-7;
const ll block = 450;
const ll inf = 2e18;
ll n,k,a[N],ans=inf;
bool bit(ll num, ll pos) {
    return ((num >> pos) & 1);
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
cin>>n>>k;
for(ll i = 1; i<=n; i++) {
    cin>>a[i];
}
vector <ll> v;
for(ll i = 2; i<=n; i++) {
    v.pb(a[i] - a[i-1]);
}
sort(all(v));
ans = k;
for(ll i = 0; i<v.size() && i < n-k; i++) {
    ans += v[i];
}
cout<<ans;
return 0;
}
// equal, min, max, 1, random, build
/*

*/

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