# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
362195 | sumit_kk10 | Cloud Computing (CEOI18_clo) | C++14 | 1138 ms | 2284 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 fast ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
#define ll long long int
using namespace std;
const int MOD = 1e9 + 7;
const int N = 2e5 + 5;
long long int dp[1000000 + 1], sum = 0;
vector<pair<long long int, pair<long long int, long long int> > > v;
void solve() {
int n;
cin >> n;
for(int i = 0; i < n; ++i){
long long int c, f, p;
cin >> c >> f >> p;
sum += c;
p *= -1;
v.push_back({f, {c, p}});
}
int m;
cin >> m;
for(int i = 0; i < m; ++i){
long long int c, f, p;
cin >> c >> f >> p;
sum += c;
c *= -1;
v.push_back({f, {c, p}});
}
sort(v.begin(), v.end());
for(int i = 0; i < v.size(); ++i){
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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |