# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
448749 | CaoHuuKhuongDuy | Cloud Computing (CEOI18_clo) | C++14 | 1022 ms | 2036 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 <iostream>
#include <stdio.h>
#include <algorithm>
using namespace std;
#define int long long
const int N=2e5+9;
const int oo=1e17;
int f[2][N];
struct computer
{
int c,f,val;
}a[N];
bool compa(computer a,computer b)
{
if (a.f==b.f) return a.c>b.c;
return a.f>b.f;
}
signed main()
{
ios::sync_with_stdio(false);
cin.tie(0);
//freopen("test.inp","r",stdin);
int n,m;
cin>>n;
int sum=0;
for (int i=1;i<=n;i++)
{
cin>>a[i].c>>a[i].f>>a[i].val;
a[i].val=-a[i].val;
sum+=a[i].c;
# | 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... |