제출 #1333774

#제출 시각아이디문제언어결과실행 시간메모리
1333774marzuq01나일강 (IOI24_nile)C++20
0 / 100
24 ms4144 KiB
#include "nile.h"
#include <bits/stdc++.h>
using namespace std;
#define lint long long
std::vector<long long> calculate_costs(std::vector<int> W, std::vector<int> A,
                                       std::vector<int> B, std::vector<int> E) {
    lint n = W.size();
    lint q = E.size();
    //wi = 1
    lint sum = 0ll;
    for (auto i: B) sum += i;
    vector<lint> arr(n);
    for (lint i = 0; i < n;i++) arr[i] = A[i] - B[i];
    sort(arr.begin(),arr.end());
    if (n % 2 == 1) sum += arr[0];
    vector<lint> ans(n);
    for (auto &i: ans) i = sum;
    return ans;
}
#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...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...