# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
361764 | ritul_kr_singh | Cloud Computing (CEOI18_clo) | C++14 | 1257 ms | 3712 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;
#define int long long
#define pii pair<int, int>
#define clock first
#define core second.first
#define price second.second
signed main(){
ios_base::sync_with_stdio(false); cin.tie(nullptr);
int n, m; cin >> n;
pair<int, pii> comps[4000]; // clock rate, {core, price}
pair<int, pii> ii;
int sum = 0, sum1 = 0;
for(int j=0; j<n; ++j){
cin >> ii.core >> ii.clock >> ii.price;
ii.price = -ii.price;
comps[j] = ii;
sum += ii.core;
}
cin >> m;
for(int j=0; j<m; ++j){
cin >> ii.core >> ii.clock >> ii.price;
sum1 += ii.core;
ii.core = -ii.core;
comps[n+j] = ii;
}
n += m;
sort(comps, comps+n, greater<>());
int lim=max(sum, sum1);
# | 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... |