# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
1049709 |
2024-08-09T04:24:53 Z |
vjudge1 |
Stove (JOI18_stove) |
C++17 |
|
0 ms |
348 KB |
#include <bits/stdc++.h>
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,lzcnt,mmx,abm,avx,avx2,fma")
#pragma GCC optimize("Ofast,unroll-loops,no-stack-protector,fast-math,inline")
using namespace std;
#define speed ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0)
#define vc vector
#define mp make_pair
#define pb push_back
#define fi first
#define se second
#define ll long long
#define all(x) x.begin(),x.end()
#define sz(x) (int)x.size()
const int N = 1e5 + 5;
const int M = 1e5 + 5;
const int mod = 1e9 + 7;
const int block = 500;
int n, k, a[N];
void solve() {
cin >> n >> k;
ll ans = n;
for ( int i = 1; i <= n; i++ ) {
cin >> a[i];
}
vc <int> save;
sort(all(save));
for ( int i = 1; i <= n; i++ ) {
if ( a[i-1] - a[i] <= 1 ) continue;
save.pb(a[i-1]);
}
save.pb(a[n]);
if ( sz(save) <= k ) {
cout << ans;
return;
}
vc <int> dist;
for ( int i = 1; i < sz(save); i++ ) {
dist.pb(save[i]-save[i-1]-1);
}
sort(all(dist));
int k2 = sz(save) - k;
for ( int i = 0; i < k2; i++ ) {
ans += dist[i];
}
cout << ans;
}
signed main() {
speed;
int tt;
//cin >> tt;
tt = 1;
while ( tt-- ) {
solve();
cout << '\n';
}
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
348 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
348 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
348 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |