| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 1033583 |
2024-07-25T04:03:52 Z |
vjudge1 |
Stove (JOI18_stove) |
C++17 |
|
15 ms |
2412 KB |
#include <bits/stdc++.h>
#define int long long
#define vtr vector
#define vi vtr<int>
#define ii pair<int, int>
#define fi first
#define se second
#define len(s) (int)s.size()
#define fd(v, s, e) for (int v = s; v < e; ++v)
#define bk(v, s, e) for (int v = s-1; v >= e; --v)
#define farr(i, arr) for (auto i: arr)
#define all(arr) arr.begin(), arr.end()
using namespace std;
void presolve()
{
}
void solve()
{
int n, k; cin >> n >> k;
--k;
vi a(n);
farr (&i, a) cin >> i;
vi d;
fd (i, 1, n) d.emplace_back(a[i] - a[i-1]);
int ans = a[n-1] - a[0] + 1;
sort(all(d), greater<int>());
fd (i, 0, k) ans -= d[i] - 1;
cout << ans;
}
signed main()
{
ios::sync_with_stdio(0);
cin.tie(0); cout.tie(0);
int Tc = 1; // cin >> Tc;
auto S = chrono::high_resolution_clock::now();
presolve();
for (int T = 1; T <= Tc; ++T)
{ solve(); cout << '\n'; }
auto F = chrono::high_resolution_clock::now();
double TC = chrono::duration_cast<chrono::microseconds>(F - S).count();
cerr << setprecision(6) << fixed
<< "\nExecution time: " << TC * (1e-6) << " sec\n";
return 0;
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
344 KB |
Output is correct |
| 2 |
Correct |
0 ms |
344 KB |
Output is correct |
| 3 |
Correct |
0 ms |
348 KB |
Output is correct |
| 4 |
Correct |
1 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 |
344 KB |
Output is correct |
| 8 |
Correct |
1 ms |
348 KB |
Output is correct |
| 9 |
Correct |
0 ms |
348 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
344 KB |
Output is correct |
| 2 |
Correct |
0 ms |
344 KB |
Output is correct |
| 3 |
Correct |
0 ms |
348 KB |
Output is correct |
| 4 |
Correct |
1 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 |
344 KB |
Output is correct |
| 8 |
Correct |
1 ms |
348 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 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
344 KB |
Output is correct |
| 2 |
Correct |
0 ms |
344 KB |
Output is correct |
| 3 |
Correct |
0 ms |
348 KB |
Output is correct |
| 4 |
Correct |
1 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 |
344 KB |
Output is correct |
| 8 |
Correct |
1 ms |
348 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 |
13 ms |
2268 KB |
Output is correct |
| 17 |
Correct |
14 ms |
2268 KB |
Output is correct |
| 18 |
Correct |
15 ms |
2264 KB |
Output is correct |
| 19 |
Correct |
14 ms |
2268 KB |
Output is correct |
| 20 |
Correct |
14 ms |
2404 KB |
Output is correct |
| 21 |
Correct |
14 ms |
2268 KB |
Output is correct |
| 22 |
Correct |
14 ms |
2412 KB |
Output is correct |
| 23 |
Correct |
14 ms |
2268 KB |
Output is correct |
| 24 |
Correct |
13 ms |
2404 KB |
Output is correct |
