# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1099959 | 2024-10-12T09:11:13 Z | Trn115 | Stove (JOI18_stove) | C++11 | 15 ms | 3028 KB |
#include <bits/stdc++.h> #define int long long #define fi first #define se second #define all(v) v.begin(), v.end() using namespace std; inline void setio(string name = "") { cin.tie(0)->sync_with_stdio(0); if (fopen((name+".INP").c_str(), "r")) { freopen((name+".INP").c_str(), "r", stdin); freopen((name+".OUT").c_str(), "w", stdout); } } int n, k; vector<int> t; inline void input() { cin >> n >> k; t.resize(n); for (int &i : t) cin >> i; } inline void solve() { vector<int> g(n-1); for (int i = 0; i < n-1; ++i) g[i] = t[i+1] - t[i] - 1; int total = t.back() - t.front() + 1; sort(all(g), greater<int>()); cout << total - accumulate(g.begin(), g.begin()+(k-1), 0); } signed main() { setio(); input(); solve(); }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 348 KB | Output is correct |
2 | Correct | 0 ms | 348 KB | Output is correct |
3 | Correct | 1 ms | 452 KB | Output is correct |
4 | Correct | 0 ms | 348 KB | Output is correct |
5 | Correct | 0 ms | 348 KB | Output is correct |
6 | Correct | 0 ms | 348 KB | Output is correct |
7 | Correct | 0 ms | 348 KB | Output is correct |
8 | Correct | 0 ms | 348 KB | Output is correct |
9 | Correct | 0 ms | 348 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 348 KB | Output is correct |
2 | Correct | 0 ms | 348 KB | Output is correct |
3 | Correct | 1 ms | 452 KB | Output is correct |
4 | Correct | 0 ms | 348 KB | Output is correct |
5 | Correct | 0 ms | 348 KB | Output is correct |
6 | Correct | 0 ms | 348 KB | Output is correct |
7 | Correct | 0 ms | 348 KB | Output is correct |
8 | Correct | 0 ms | 348 KB | Output is correct |
9 | Correct | 0 ms | 348 KB | Output is correct |
10 | Correct | 1 ms | 344 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 |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 348 KB | Output is correct |
2 | Correct | 0 ms | 348 KB | Output is correct |
3 | Correct | 1 ms | 452 KB | Output is correct |
4 | Correct | 0 ms | 348 KB | Output is correct |
5 | Correct | 0 ms | 348 KB | Output is correct |
6 | Correct | 0 ms | 348 KB | Output is correct |
7 | Correct | 0 ms | 348 KB | Output is correct |
8 | Correct | 0 ms | 348 KB | Output is correct |
9 | Correct | 0 ms | 348 KB | Output is correct |
10 | Correct | 1 ms | 344 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 | 14 ms | 2908 KB | Output is correct |
17 | Correct | 14 ms | 2908 KB | Output is correct |
18 | Correct | 14 ms | 2908 KB | Output is correct |
19 | Correct | 14 ms | 2908 KB | Output is correct |
20 | Correct | 14 ms | 2908 KB | Output is correct |
21 | Correct | 14 ms | 3028 KB | Output is correct |
22 | Correct | 14 ms | 3008 KB | Output is correct |
23 | Correct | 15 ms | 2908 KB | Output is correct |
24 | Correct | 14 ms | 2908 KB | Output is correct |