题解 | 知识竞赛

//region define
#include <bits/stdc++.h>
#define IOS ios::sync_with_stdio(false);cin.tie(0),cout.tie(0)
#define eb emplace_back
#define pb push_back
#define mid(x,y) x+((y-x)>>1)
#define rep(i,a,b) for(int i = a ; i <= b ; i++)
#define per(i,a,b) for(int i = a ; i >= b ; i--)
using namespace std;
int dy[4] = {-1, 1, 0, 0};
int dx[4] = {0, 0, -1, 1};
typedef long long ll;
typedef __int128 lll;
const int MOD = 1e9 + 7;
//endregion
void solve() {
    int n;
    cin >> n;
    vector<vector<int>> arr(n, vector<int>(2));
    int idx1 = 0, idx2 = 0;
    rep(i, 0, n - 1) {
        cin >> arr[i][0] >> arr[i][1];
        idx1 = arr[idx1][0] * 3 + arr[idx1][1] > arr[i][0] * 3 + arr[i][1] ? idx1 : i;
        if(i != n-1){
            idx2 = arr[idx2][1] * 3 + arr[idx2][0] > arr[i][1] * 3 + arr[i][0] ? idx2 : i;
        }
    }
    cout << ((double)(min(arr[idx1][0] + arr[idx2][0],
                          arr[idx1][1] + arr[idx2][1])))/2 << endl;
}
signed main() {
    IOS;
    int T = 1;
    // cin >> T;
    while (T--) {
        solve();
    }
    return 0;
}

（本人菜鸟）题目数据有点水了，我给推理能力阅读能力加个权就过了