| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 1049782 |
2024-08-09T04:59:23 Z |
vjudge1 |
Stove (JOI18_stove) |
C++17 |
|
12 ms |
2012 KB |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define pll pair<ll, ll>
#define fi first
#define se second
#define pb push_back
#define speed ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
int main() {
speed;
int n, k;
cin >> n >> k;
vector<int> t(n);
for(int i = 0; i < n; i++) cin >> t[i];
sort(begin(t), end(t));
vector<ll> v; int l = n;
ll ans = 1ll * n;
for(int i = 0; i < n - 1; i++) v.pb(1ll * (t[i+1] - t[i] - 1));
sort(begin(v), end(v));
for(ll i : v) {
if(l > k) {
ans += 1ll * i;
l--;
}
}
cout << ans;
}
| # |
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 |
0 ms |
348 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 |
0 ms |
348 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 |
0 ms |
348 KB |
Output is correct |
| 11 |
Correct |
0 ms |
348 KB |
Output is correct |
| 12 |
Correct |
0 ms |
348 KB |
Output is correct |
| 13 |
Correct |
0 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 |
0 ms |
348 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 |
0 ms |
348 KB |
Output is correct |
| 11 |
Correct |
0 ms |
348 KB |
Output is correct |
| 12 |
Correct |
0 ms |
348 KB |
Output is correct |
| 13 |
Correct |
0 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 |
12 ms |
2012 KB |
Output is correct |
| 17 |
Correct |
12 ms |
2012 KB |
Output is correct |
| 18 |
Correct |
12 ms |
2012 KB |
Output is correct |
| 19 |
Correct |
12 ms |
2012 KB |
Output is correct |
| 20 |
Correct |
12 ms |
2012 KB |
Output is correct |
| 21 |
Correct |
12 ms |
2012 KB |
Output is correct |
| 22 |
Correct |
12 ms |
2012 KB |
Output is correct |
| 23 |
Correct |
12 ms |
2008 KB |
Output is correct |
| 24 |
Correct |
12 ms |
2012 KB |
Output is correct |
