# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
958833 | 2024-04-07T00:00:27 Z | vjudge1 | Stove (JOI18_stove) | C++17 | 19 ms | 2404 KB |
#include <bits/stdc++.h> #define range(it, a, b) for (ll it = a; it < b; it++) #define all(x) begin(x), end(x) #define ll long long #define ull unsigned long long #define INF64 ((ll) 1 << 62) #define INF32 (1 << 30) #define mset multiset #define uset unordered_set #define umap unordered_map #define pqueue priority_queue #define ptr(A) shared_ptr<A> using namespace std; void setio (string name) { ios_base::sync_with_stdio(0); cin.tie(0); if (name.size()) { freopen((name + ".txt").c_str(), "r", stdin); freopen((name + ".out").c_str(), "w", stdout); } } ll n, k; vector<ll> arr; void solve() { cin >> n >> k; arr.resize(n); range(i, 0, n) cin >> arr[i]; ll cnt = n; if (k >= n) { cout << cnt; return; } pqueue<ll> dif; range(i, 1, n) dif.push(-abs(arr[i] - arr[i-1])); while (n > k) { n--; cnt += -dif.top() -1; dif.pop(); } cout << cnt; } int main () { setio(""); ll t = 1; // cin >> t; while (t--) solve(); } // IT'S TOUGH, I KNOW // BUT YOU'D RATHER DIE FIGHTING THAN LIVE ON YOUR KNEES // THOUG H YOU WON'T DO NEITHER OF THOSE // IMPOSSIBLE, AS IT'S AGAINST YOUR NATURE // AS YOU ALREADY WON // I SEE YOUR MEDAL HANGING FROM YOUR NECK // SHINING AS NOTHING YOU'VE EVER HAD // THOUSANDS AND THOUSANDS OF LINES // YOU AREADY MADE IT THIS FAR // AND WHO COULD TELL HOW FAR YOU WILL GET... // BUT YOU? // THEN COME ON, YOU BASTARD! // GO CLEAR YOUR MIND AND STAND // AS EACH OF THOSE LINES IS A STEP CLOSER // CLOSER TO THE GREATNESS YOU PURSUE // CLOSER TO THE GREATNESS YOU ALREADY HAVE
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 348 KB | Output is correct |
2 | Correct | 0 ms | 348 KB | Output is correct |
3 | Correct | 1 ms | 348 KB | Output is correct |
4 | Correct | 0 ms | 348 KB | Output is correct |
5 | Correct | 0 ms | 344 KB | Output is correct |
6 | Correct | 0 ms | 348 KB | Output is correct |
7 | Correct | 0 ms | 348 KB | Output is correct |
8 | Correct | 1 ms | 344 KB | Output is correct |
9 | Correct | 0 ms | 348 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 348 KB | Output is correct |
2 | Correct | 0 ms | 348 KB | Output is correct |
3 | Correct | 1 ms | 348 KB | Output is correct |
4 | Correct | 0 ms | 348 KB | Output is correct |
5 | Correct | 0 ms | 344 KB | Output is correct |
6 | Correct | 0 ms | 348 KB | Output is correct |
7 | Correct | 0 ms | 348 KB | Output is correct |
8 | Correct | 1 ms | 344 KB | Output is correct |
9 | Correct | 0 ms | 348 KB | Output is correct |
10 | Correct | 1 ms | 348 KB | Output is correct |
11 | Correct | 1 ms | 348 KB | Output is correct |
12 | Correct | 1 ms | 348 KB | Output is correct |
13 | Correct | 1 ms | 348 KB | Output is correct |
14 | Correct | 1 ms | 348 KB | Output is correct |
15 | Correct | 1 ms | 348 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 348 KB | Output is correct |
2 | Correct | 0 ms | 348 KB | Output is correct |
3 | Correct | 1 ms | 348 KB | Output is correct |
4 | Correct | 0 ms | 348 KB | Output is correct |
5 | Correct | 0 ms | 344 KB | Output is correct |
6 | Correct | 0 ms | 348 KB | Output is correct |
7 | Correct | 0 ms | 348 KB | Output is correct |
8 | Correct | 1 ms | 344 KB | Output is correct |
9 | Correct | 0 ms | 348 KB | Output is correct |
10 | Correct | 1 ms | 348 KB | Output is correct |
11 | Correct | 1 ms | 348 KB | Output is correct |
12 | Correct | 1 ms | 348 KB | Output is correct |
13 | Correct | 1 ms | 348 KB | Output is correct |
14 | Correct | 1 ms | 348 KB | Output is correct |
15 | Correct | 1 ms | 348 KB | Output is correct |
16 | Correct | 19 ms | 2268 KB | Output is correct |
17 | Correct | 19 ms | 2268 KB | Output is correct |
18 | Correct | 19 ms | 2404 KB | Output is correct |
19 | Correct | 18 ms | 2268 KB | Output is correct |
20 | Correct | 15 ms | 2268 KB | Output is correct |
21 | Correct | 10 ms | 2396 KB | Output is correct |
22 | Correct | 10 ms | 2264 KB | Output is correct |
23 | Correct | 9 ms | 2264 KB | Output is correct |
24 | Correct | 10 ms | 2268 KB | Output is correct |