# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
149567 | dragoon (#200) | Crosses on the Grid (FXCUP4_cross) | C++17 | 129 ms | 6888 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 <utility>
#include <queue>
#include <algorithm>
using namespace std;
priority_queue<int> PQ;
vector<pair<int, int>> V;
long long SelectCross(int K, std::vector<int> I, std::vector<int> O) {
int n = I.size();
for (int i = 0; i < n; i++) {
V.push_back({I[i], O[i]});
}
sort(V.begin(), V.end());
reverse(V.begin(), V.end());
for (int i = 0; i < K - 1; i++) {
PQ.push(-V[i].second);
}
long long ret = 0;
for (int i = K - 1; i < n; i++) {
PQ.push(-V[i].second);
if (PQ.size() > K) PQ.pop();
long long o = -PQ.top();
long long in = V[i].first;
long long now = 2 * o * in - in * in;
if (now > ret) ret = now;
}
return ret;
}
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... |