# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
362696 | wind_reaper | Cloud Computing (CEOI18_clo) | C++17 | 476 ms | 1408 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;
int32_t main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n;
cin >> n;
vector<array<int, 4>> o;
for(int i = 0; i < n; i++){
int c, f, v;
cin >> c >> f >> v;
o.push_back({f, c, v, 0});
}
int m;
cin >> m;
for(int i = 0; i < m; i++){
int c, f, v;
cin >> c >> f >> v;
o.push_back({f, c, v, 1});
}
sort(o.begin(), o.end(), [](array<int, 4> a, array<int, 4> b){
if(a[0] == b[0]){
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |