| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1344261 | taly | Nile (IOI24_nile) | C++20 | 0 ms | 0 KiB |
#include <bits/stdc++.h>
using namespace std;
#define lli long long
#define pii pair<int, int>
#define ff first
#define ss second
#define sz size
#define rsz resize
#define pb push_back
#define ass assign
#define endl '\n'
#define all(x) (x).begin(),(x).end()
int n, q;
vector<long long> calculate_costs(vector<int> W, vector<int> A, vector<int> B, vector<int> E){
lli soma=0;
for(int i=0; i<n; i++){
soma+=B[i];
}
// cout << soma<<endl;
lli resp=1e18;
if(n%2==1){
for(int i=0; i<n; i++){
resp=min(resp, soma-B[i]+A[i]);
// cout << resp << endl;
}
}
vector<lli> R(q);
for(int i=0; i<q; i++){
R[i]=resp;
}
return R;
}
signed main(){
ios::sync_with_stdio(false);
cin.tie(NULL);
cin >> n;
vector<int> W(n), A(n), B(n);
for(int i=0; i<n; i++){
cin >> W[i]>>A[i]>>B[i];
}
cin >> q;
vector<int> E(q);
for(int i=0; i<q; i++){
cin >> E[i];
}
vector<lli> R = calculate_costs(W, A, B, E);
for(int i:R){
cout << i << endl;
}
}
