# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
166186 | Eae02 | Cloud Computing (CEOI18_clo) | C++17 | 568 ms | 2300 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>
#define all(x) begin(x), end(x)
using ll = long long;
using namespace std;
struct Item {
ll c, f, p;
bool operator<(const Item& o) const {
return make_tuple(-f, -c) < make_tuple(-o.f, -o.c);
}
};
vector<Item> items;
int main() {
ll n; cin >> n;
for (ll i = 0; i < n; i++) {
Item& item = items.emplace_back();
cin >> item.c >> item.f >> item.p;
item.p = -item.p;
}
ll m; cin >> m;
for (ll i = 0; i < m; i++) {
Item& item = items.emplace_back();
cin >> item.c >> item.f >> item.p;
item.c = -item.c;
}
sort(all(items));
# | 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... |