제출 #149019

#제출 시각아이디문제언어결과실행 시간메모리
149019JeffreyHo (#200)Crosses on the Grid (FXCUP4_cross)C++17
100 / 100
273 ms14436 KiB
#include "cross.h"
#include <bits/stdc++.h>
using namespace std;

long long SelectCross(int k, std::vector<int> a, std::vector<int> b) {
	int n = (int)a.size();
    pair<int, int> c[200005] = {};
    for (int i = 0; i < n; i++) c[i] = {b[i], a[i]};
    sort(c, c + n); reverse(c, c + n);
    multiset<int> s;
    for (int i = 0; i < k; i++) s.insert(c[i].second);
    long long z = 1ll * c[k - 1].first * c[k - 1].first - 1ll * (c[k - 1].first - *s.begin()) * (c[k - 1].first - *s.begin());
    for (int i = k; i < n; i++) {
        s.insert(c[i].second);
        s.erase(s.find(*s.begin()));
        z = max(z, 1ll * c[i].first * c[i].first - 1ll * (c[i].first - *s.begin()) * (c[i].first - *s.begin()));
    }
	return z;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...