oj.uz

Submission #1033777

# Submission time Handle Problem Language Result Execution time Memory
1033777 2024-07-25T05:51:18 Z vjudge1 Stove (JOI18_stove) C++17
0 / 100
 0 ms 344 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;

int main()
{
    cin >> n >> k;
    cin >> t[1];
    sum += t[1];
    for(int i = 2; i <= n; i++)
    {
        cin >> t[i];
        pq.push(t[i] - t[i - 1]);
    }
    k = n - k;
    ll res = n;
    while(!pq.empty() && k > 0)
    {
        res = res - pq.top();
        //cout << pq.top() << ' ';
        pq.pop();
        k--;
    }
    cout << n + 1;
}

Subtask #1
0 / 20.0

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