oj.uz

Submission #1012991

# Submission time Handle Problem Language Result Execution time Memory
1012991 2024-07-03T04:23:57 Z aufan Stove (JOI18_stove) C++17
0 / 100
 1 ms 344 KB 
#include <bits/stdc++.h>
#define int long long
#define fi first
#define se second

using namespace std;

int32_t main()
{
        ios_base::sync_with_stdio(false);
        cin.tie(NULL);
        
        int n, k;
        cin >> n >> k;

        vector<int> t(n + 1);
        for (int i = 1; i <= n; i++) cin >> t[i];

        vector<int> b;
        for (int i = 1; i <= n - 1; i++) b.push_back(t[i + 1] - t[i]);
        sort(b.rbegin(), b.rend());

        int ans = t[n] + 1 - t[1];
        for (int i = 0; i < n - k; i++) {
                ans -= (b[i] - 1);
        }

        cout << ans << '\n';
        
        return 0;
}

Subtask #1
0 / 20.0

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

Subtask #2
0 / 30.0

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

Subtask #3
0 / 50.0

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