oj.uz

Submission #1033780

# Submission time Handle Problem Language Result Execution time Memory
1033780 2024-07-25T06:01:29 Z vjudge1 Stove (JOI18_stove) C++17
0 / 100
 0 ms 348 KB 
#include<bits/stdc++.h>
#define ll long long
using namespace std;

int n, k;
const int maxn = 2e5;
ll t[maxn + 3];
priority_queue<ll>pq;
ll sum;
ll mx;

int main()
{
    cin >> n >> k;
    for(int i = 1; i <= n; i++)
    {
        cin >> t[i];
    }
    sort(t + 1, t + n + 1);
    ll res = t[n] + 1;
    for(int i = 2; i <= n; i++)
    {
        pq.push(t[i] - t[i - 1] - 1);
    }
    k = n - k;
    while(k > 0 && pq.size())
    {
        res -= pq.top();
        k--;
    }
    cout << res;
}

Subtask #1
0 / 20.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 348 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 348 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 348 KB Output isn't correct
2 Halted 0 ms 0 KB -