Submission #306067

#	Time	Username	Problem	Language	Result	Execution time	Memory
306067		syy	Stove (JOI18_stove)	C++17	100 / 100	24 ms	3324 KiB

stove

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define FOR(i, a, b) for(int i = (int)a; i <= (int)b; i++)
#define DEC(i, a, b) for(int i = (int)a; i >= (int)b; i--)
typedef pair<int, int> pi;
typedef pair<pi, int> pii;
typedef pair<pi, pi> pipi;
#define f first
#define s second
typedef vector<int> vi;
typedef vector<pi> vpi;
typedef vector<pii> vpii;
#define pb push_back
#define pf push_front
#define all(v) v.begin(), v.end()
#define disc(v) sort(all(v)); v.resize(unique(all(v)) - v.begin());
#define INF (int) 1e9 + 100
#define LLINF (ll) 1e18
#define fastio ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define sandybridge __attribute__((optimize("Ofast"), target("arch=sandybridge")))
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());    //can be used by calling rng() or shuffle(A, A+n, rng)
inline ll rand(ll x, ll y) { ++y; return (rng() % (y-x)) + x; } //inclusivesss

ll n, k, arr[100005], ans;
vector<ll> v;

int main() {
	fastio; cin >> n >> k;
	FOR(i, 1, n) cin >> arr[i];
	FOR(i, 2, n) v.pb(arr[i] - arr[i-1] - 1);
	sort(all(v), greater<ll>());
	cout << arr[n] - arr[1] + 1 - accumulate(v.begin(), v.begin() + k-1, 0);
}

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