# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
952002 | GrandTiger1729 | Cake 3 (JOI19_cake3) | C++17 | 4081 ms | 7324 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
const long long INF = 1e18;
int main()
{
cin.tie(0)->sync_with_stdio(0);
int n, K;
cin >> n >> K;
vector<pair<int, int>> a(n);
for (int i = 0; i < n; i++)
{
cin >> a[i].second >> a[i].first;
}
sort(a.begin(), a.end());
long long ans = -INF;
function<void(int, int, int, int)> solve = [&](int l, int r, int ql, int qr)
{
if (l > r)
{
return;
}
int mid = (l + r) / 2;
pair<long long, int> maxn(-INF, -1);
long long cur = 0;
priority_queue<int, vector<int>, greater<>> pq;
int i = mid;
for (; i > qr; i--)
{
pq.push(a[i].second);
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |