제출 #1332573

#제출 시각아이디문제언어결과실행 시간메모리
1332573islam_2010Stove (JOI18_stove)C++20
0 / 100
0 ms348 KiB
#pragma GCC optimize("O3")
#include <bits/stdc++.h>
#define all(x) x.begin(), x.end()
using namespace std;

const int sz = 2e5+5;

int pref[sz];

int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    
    int n, m;
    cin >> n >> m;
    vector<int> a(n);
    vector<int> b(n-1);
    for(int i = 0; i < n; i++){
        cin >> a[i];
    }for(int i = 0; i < n-1; i++){
        b[i] = a[i+1]-a[i];
    }sort(b.begin(), b.end());
    int ans = m;
    for(int i = 0; i <= n-m; i++){
        ans += b[i];
    }cout << ans;
    
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...