# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1273262 | nlhuy | Stove (JOI18_stove) | C++20 | 14 ms | 2252 KiB |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define fi first
#define se second
#define Task "test"
typedef pair<int,int>ii;
const int MOD = 1e9+7;
const int INF = 1e9+7;
const int Maxn = 1e5+7;
const int di[] = {0, 0, -1, 1};
const int dj[] = {-1, 1, 0, 0};
int n,k;
int sum;
int a[Maxn];
ii c[Maxn];
void run_case(){
cin>>n>>k;
for(int i=1;i<=n;i++) cin>>a[i];
int m=0,d=1;
a[n+1]=INF;
for(int i=2;i<=n+1;i++){
if (a[i]-a[i-1]==1) d++;
else{
c[++m]={a[i-d],a[i-1]};
sum+=d;
d=1;
}
}
if (m<=k){
cout<<sum;
return;
}
vector<int>dist;
for(int i=2;i<=m;i++) dist.push_back(c[i].fi-c[i-1].se-1);
sort(dist.begin(),dist.end());
for(int i=0;i<m-k;i++) sum+=dist[i];
cout<<sum;
}
int main(){
ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
if (fopen(Task ".inp", "r"))
{
freopen(Task ".inp", "r", stdin);
freopen(Task ".out", "w", stdout);
}
int t = 1;
//cin >> t;
while(t--){
run_case();
}
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |