# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
151232 | dolphingarlic | Crosses on the Grid (FXCUP4_cross) | C++17 | 109 ms | 9064 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 "cross.h"
#include <bits/stdc++.h>
#define FOR(i, x, y) for (int i = x; i < y; i++)
typedef long long ll;
using namespace std;
ll SelectCross(int K, vector<int> I, vector<int> O) {
int N = I.size();
vector<pair<ll, ll>> crosses;
FOR(i, 0, N) crosses.push_back({I[i], O[i]});
sort(crosses.begin(), crosses.end());
priority_queue<ll> pq;
ll ans = 0;
FOR(i, 0, N) {
pq.push(-crosses[i].second);
if (pq.size() == K) pq.pop();
if (pq.size() == K - 1) ans = max(ans, -2 * pq.top() * crosses[i].first - crosses[i].first * crosses[i].first);
}
return ans;
}
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... |