제출 #314841

#제출 시각아이디문제언어결과실행 시간메모리
314841blueJob Scheduling (IOI19_job)C++17
19 / 100
97 ms10616 KiB
#include "job.h"
#include <vector>
#include <algorithm>
using namespace std;

struct job
{
    long long u;
    long long d;
};

bool operator < (job A, job B)
{
    return A.u*B.d > B.u*A.d;
}

long long scheduling_cost(vector<int> p, vector<int> u, vector<int> d)
{
    long long res = 0;
    int n = p.size();

    job J[n-1];
    for(int i = 1; i < n; i++) J[i-1] = job{u[i], d[i]};
    sort(J, J+n-1);

    long long t = d[0];
    res += t * u[0];
    for(int i = 0; i < n-1; i++)
    {
        t += J[i].d;
        res += t * J[i].u;
    }
	return res;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...