| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1308008 | felirivera | 나일강 (IOI24_nile) | C++20 | 0 ms | 0 KiB |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
vector<ll> calculate_costs(vector<int> W, vector<int> A, vector<ll> B, vector<int> E){
vector<ll> ans = B;
int dif = 1000000000;
int in = 0;
if (W.size() % 2 != 0){
for (int i = 0; i < W.size(); i++){
if (A[i] - B[i] < dif){
dif = A[i] - B[i];
in = i;
}
}
ans[in] = A[in];
}
return ans;
}
int main(){
int N; cin >> N;
vector<int> W(N); vector<int> A(N); vector<ll> B(N);
for (int i = 0; i < N; i++){
cin >> W[i] >> A[i] >> B[i];
}
int Q; cin >> Q;
vector<int> E(Q);
for (int i = 0; i < Q; i++){
cin >> E[i];
}
vector<ll> ans = calculate_costs(W, A, B, E);
for (auto a : ans){
cout << a << "\n";
}
return 0;
}
