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>
using namespace std;
long long SelectCross(int K, std::vector<int> I, std::vector<int> O) {
int N = I.size();
vector<pair<int, int>> v;
for(int i=0; i<N; i++) v.emplace_back(I[i], O[i]);
sort(v.rbegin(), v.rend());
//for(int i=0;i <N; i++) cout << v[i].first << ' '; cout << endl;
//for(int i=0;i <N; i++) cout << v[i].second << ' '; cout << endl;
priority_queue<int, vector<int>, greater<int>> s;
for(int i=0; i<K-1; i++) {
s.push(v[i].second);
}
long long res = 0;
for(int i=K-1; i<N; i++) {
int ii = v[i].first;
int oo = min(s.top(), v[i].second);
// cout << oo << ' ' << ii << endl;
res = max(res, 1LL*oo*oo - 1LL*(oo-ii)*(oo-ii));
if((int)s.size() > K-1) s.pop();
s.push(v[i].second);
}
return res;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |