# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
261844 | arnold518 | Cloud Computing (CEOI18_clo) | C++14 | 553 ms | 2168 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;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const int MAXN = 4000;
const ll INF = 1e18;
struct Data
{
int c, f, v;
};
int N, M;
Data A[MAXN+10];
ll dp[2][100000+10];
int main()
{
int i, j;
scanf("%d", &N);
for(int i=1; i<=N; i++) scanf("%d%d%d", &A[i].c, &A[i].f, &A[i].v), A[i].v*=-1;
scanf("%d", &M);
for(int i=1; i<=M; i++) scanf("%d%d%d", &A[i+N].c, &A[i+N].f, &A[i+N].v);
sort(A+1, A+N+M+1, [&](const Data &p, const Data &q)
{
if(p.f!=q.f) return p.f>q.f;
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... |