oj.uz

답안 #1049711

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1049711 2024-08-09T04:25:14 Z vjudge1 Stove (JOI18_stove) C++17
0 / 100
 0 ms 348 KB 
#ifdef ONLINE_JUDGE
#pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math,O3")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#endif
#include <bits/stdc++.h>
#define ll long long int
#define speed ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define TxtIO freopen("lol.in","r",stdin); freopen("lol.txt","w",stdout);
#define forn(i,n) for(int i=0;i<n;i++)
#define pb push_back
using namespace std;

void solve(){
    ll n,k;
    cin>>n>>k;k--;
    vector <pair<ll,ll>> v(n);
    forn(i,n){
        cin>>v[i].first;
        v[i].second=v[i].first+1;
    }
    vector <ll> razn;
    for(int i=0;i<n-1;i++){
        razn.pb(abs(v[i].second-v[i+1].first));
    }
    sort(razn.begin(),razn.end());
    ll ans=0;
    for(int i=0;i<k;i++){
        ans+=razn[i];
    }
    ans+=n;
    cout<<ans;
}

signed main(){
    speed;
    int t=1;
    while(t--){
        solve();
    }
}

Subtask #1
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 50.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -