# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
229626 | Ruxandra985 | Cloud Computing (CEOI18_clo) | C++14 | 407 ms | 1400 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 INF 2000000000000000000
using namespace std;
struct informatie{
int proc , rate , cost;
} v[4010];
int cmp (informatie x , informatie y){
if (x.rate != y.rate)
return x.rate > y.rate;
else if (x.cost != y.cost)
return x.cost < y.cost;
else return x.proc < y.proc;
}
long long dp[50 * 2000 + 10];
int main()
{
FILE *fin = stdin;
FILE *fout = stdout;
int n , i , m , elem , proc , cost , j;
long long sol;
fscanf (fin,"%d",&n);
for (i = 1 ; i <= n ; i++){ /// ofertele
fscanf (fin,"%d%d%d",&v[i].proc , &v[i].rate , &v[i].cost);
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... |