# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
149065 | 샌즈뼈 (#200) | 십자가 놓기 (FXCUP4_cross) | C++17 | 204 ms | 11232 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>
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(O[i], I[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;
set<int> s;
for(int i=0; i<K-1; i++) {
s.insert(v[i].second);
}
long long res = 0;
for(int i=K-1; i<N; i++) {
if(s.size()+1 > K) s.erase(s.begin());
s.insert(v[i].second);
int r = v[i].first;
int t = *(s.begin());
//cout <<r << ' ' << t << endl;
res = max(res, 1LL*r*r - 1LL*(r-t)*(r-t));
}
return res;
}
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... |