# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
260004 | Kenzo_1114 | Cloud Computing (CEOI18_clo) | C++17 | 1 ms | 384 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;
const int MAXN = 2010;
int n, m;
long long c[MAXN], C[MAXN], f[MAXN], F[MAXN], v[MAXN], V[MAXN];
bool cmp(pair<long long int, long long int> a, pair<long long int, long long int>b)
{
if(a.first != b.first) return a.first > b.first;
return a.second < b.second;
}
bool cmp2(pair<long long int, long long int>a, pair<long long int, long long int>b)
{
if(a.second != b.second) return a.second > b.second;
return a.first < b.first;
}
int main ()
{
scanf("%d", &n);
vector<pair<long long int, long long int> > aux[2];
for(int i = 0; i < n; i++)
{
scanf("%lld %lld %lld", &c[i], &f[i], &v[i]);
aux[0].push_back(make_pair(c[i], v[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... |