oj.uz

답안 #1014709

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1014709 2024-07-05T10:15:45 Z Akshat369 Stove (JOI18_stove) C++17
0 / 100
 1 ms 344 KB 
#include <bits/stdc++.h>

using namespace std;
#define int long long
#define INF (int)1e18
#define endl '\n'
const int mod = 1000 * 1000 * 1000 + 7;
const int N = 100005;
#define f first
#define s second
#define rep(i, a, b) for(int i = (a); i < (b); i++)
#define rrep(i, a, b) for(int i = (a); i > (b); i--)
#define vi vector<int>
#define pii pair<int, int>
#define all(x) (x).begin(), (x).end()

mt19937_64 RNG(chrono::steady_clock::now().time_since_epoch().count());

/*

*/

void Solve() {
    int n , k;
    cin>>n>>k;
    vi a(n);
    for(int i = 0 ; i < n ;i++){
        cin>>a[i];
    }
    vi diff;
    for (int i = 0; i < n - 1; ++i) {
        diff.push_back(a[i+1]-a[i]+1);
    }

   // debug(diff);
    sort(all(diff));
 
    int sz = (diff.size());
    for (int i = 0; i < min(sz,k); ++i) {
        diff.pop_back();
    }
 //   debug(diff);
    int ans = 0;
    for(auto &i : diff){
        ans+= i;
    }
    cout<<ans<<endl;

}

int32_t main() {
    auto begin = std::chrono::high_resolution_clock::now();
    ios_base::sync_with_stdio(false);
    cin.tie(0);

    int t = 1;
 //   cin >> t;
    for (int i = 1; i <= t; i++) {
        //cout << "Case #" << i << ": ";
        Solve();
    }
    auto end = std::chrono::high_resolution_clock::now();
    auto elapsed = std::chrono::duration_cast<std::chrono::nanoseconds>(end - begin);
    cerr << "Time measured: " << elapsed.count() * 1e-9 << " seconds.\n";
    return 0;
}

Subtask #1
0 / 20.0

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

Subtask #2
0 / 30.0

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

Subtask #3
0 / 50.0

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