# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
967675 | 2024-04-22T15:46:12 Z | vjudge1 | Stove (JOI18_stove) | C++17 | 0 ms | 344 KB |
#include <iostream> #include <algorithm> #include <queue> #include <vector> using namespace std; using ll = long long; void print(priority_queue<ll, vector<ll>, greater<ll>> pq){ while (!pq.empty()){ printf("%lld, ", pq.top()); pq.pop(); } printf("\n"); } int main() { priority_queue<ll, vector<ll>, greater<ll>> pq; int n, k; long long pre, curr, ans; scanf("%d %d %lld", &n, &k, &pre); ans = pre; if (n == k) return printf("0"), 0; for (int i = 1;i < n;i++){ scanf("%lld", &curr); pq.push(curr-pre+1); pre = curr; } pq.push(1); ans = 0; while (k--){ //printf("pq = %lld\n", pq.top()); ans += pq.top(); pq.pop(); } printf("%lld", ans); }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 0 ms | 344 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 0 ms | 344 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 0 ms | 344 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |