#include <iostream>
#include "nile.h"
#include <algorithm>
using namespace std;
bool comp(pair<long long,long long> x,pair<long long,long long> y)
{
return (x.first-x.second)>(y.first-y.second);
}
vector<long long> calculate_costs(vector<int> W, vector<int> A,vector<int> B, vector<int> E)
{
long long i,n,rasp;
n=W.size();
vector<pair<long long,long long>> pr;
pr.resize(n);
for(i=0;i<n;i++)
{
pr[i].first=A[i];
pr[i].second=B[i];
}
sort(pr.begin(),pr.end(),comp);
rasp=0;
for(i=1;i<n;i+=2)
{
rasp+=pr[i].second+pr[i-1].second;
}
if(n%2==1)
rasp+=pr[n-1].first;
vector<long long> R;
R.resize(E.size());
for(i=0;i<R.size();i++)
{
R[i]=rasp;
}
return R;
}
# | 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... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |