oj.uz

Submission #797885

# Submission time Handle Problem Language Result Execution time Memory
797885 2023-07-30T04:57:49 Z MVP_Harry Stove (JOI18_stove) C++17
0 / 100
 0 ms 324 KB 
#include <bits/stdc++.h>
using namespace std;
#define INF 0x3f3f3f3f
#define ll long long
#define rep(i, m, n) for (int i = m; i <= n; i++)
#define per(i, m, n) for (int i = m; i >= n; i--)

const int maxn = 1e5 + 5;

int n, k;
int a[maxn];

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0); cout.tie(0);

    cin >> n >> k;
    
    vector<int> d;
    cin >> a[1];
    rep(i, 2, n) {
        cin >> a[i];
        d.push_back(a[i] - a[i - 1] - 1);
    }

    int ans = a[n] - a[1] + 1;
    sort(begin(d), end(d), greater<int>());
    rep(i, 1, n - 1) {
        ans -= d[i - 1];
    }

    cout << ans << endl;
    
    return 0;
}

Subtask #1
0 / 20.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 324 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 30.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 324 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 50.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 324 KB Output isn't correct
2 Halted 0 ms 0 KB -