codeforces--733B. Parade

problem

题解

题意抽象一下，有两个数组 $l[...], r[...]$，可以从中选择某一$l[i], r[i]$交换，也可以不选，求使$|L - R|$最小的i. $L = \sum_{i=1}^{n}l[i]$,  $R = \sum_{i=1}^{n}r[i]$.

#include <bits/stdc++.h>
using namespace std;

const int maxn = 100000 + 4;
int l[maxn], r[maxn];
int n;

int main(){

    while(cin >> n){
        int L = 0, R = 0;
        for(int i = 1; i <= n; ++i){
            scanf("%d %d", l + i, r + i);
            L += l[i];
            R += r[i];
        }
        int ans = abs(L - R);
        int k = 0;
        for(int i = 1; i <= n; ++i){
            int t = abs(L - R + 2*r[i] - 2*l[i]);
            if(ans < t) k = i, ans = t;
        }
        cout << k << endl;
    }
    return 0;
}