Codeforces Round #378 (Div. 2)B. Parade

链接：http://codeforces.com/contest/733/problem/B

题意：给定多组l[i],r[i]，令L为l的总和R为r的总和，求最多交换一组的l[i],r[i]使得|L-R|最大，输出交换的那组。

分析：模拟

代码：

#include<map>
#include<set>
#include<stack>
#include<cmath>
#include<queue>
#include<bitset>
#include<math.h>
#include<vector>
#include<string>
#include<stdio.h>
#include<cstring>
#include<iostream>
#include<algorithm>
#pragma comment(linker, "/STACK:102400000,102400000")
using namespace std;
typedef double db;
typedef long long ll;
typedef unsigned int uint;
typedef unsigned long long ull;
const db eps=1e-5;
const int N=1e5+10;
const int M=1e5+10;
const ll MOD=1000000007;
const int mod=1000000007;
const int MAX=1000000010;
const double pi=acos(-1.0);
int l[N],r[N];
int main()
{
    int i,n,L=0,R=0,ans=0,mx;
    scanf("%d", &n);
    for (i=1;i<=n;i++) scanf("%d%d", &l[i], &r[i]),L+=l[i],R+=r[i];
    mx=abs(L-R);
    for (i=1;i<=n;i++)
    if (abs(L-l[i]+r[i]-(R+l[i]-r[i]))>mx) {
        ans=i;mx=abs(L-l[i]+r[i]-(R+l[i]-r[i]));
    }
    printf("%d\n", ans);
    return 0;
}