# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
500566 | kappa | Preokret (COCI18_preokret) | C++14 | 1 ms | 332 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 <bits/stdc++.h>
using namespace std;
int a, b, suma, sumb, trn, half;
priority_queue<pair<int, int> > pq;
int main(){
cin >> a;
while(a--){
int t;
cin >> t;
pq.push({-t, 0});
}
cin >> b;
while(b--){
int t;
cin >> t;
pq.push({-t, 1});
}
int kayb = -1;
while(!pq.empty()){
pair<int, int> curr = pq.top();
pq.pop();
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |