<每日一题> Day7：CodeForces-1166C.A Tale of Two Lands (二分 + 排序)

原题链接

参考代码：

#include <cstdio>
#define mid ((l + r) / 2)
#include <algorithm>
using namespace std;

const int maxn =  + , maxvalue = 1e9;
int n, value[maxn];

int main() {
    scanf("%d", &n);
    for(int i = ; i < n; i ++) {
        scanf("%d", &value[i]);
        if(value[i] < )
            value[i] = - value[i];
    }
    sort(value, value + n);
    long long ans = ;
    int l, r;
    for(int i = ; i < n; i ++) {
        l = i + , r = n - ;
        while(l <= r) {
            if( * value[i] >= value[mid]) l = mid + ;
            else r = mid - ;
        }
        ans += (l - i - );
    }
    printf("%lld\n", ans);
    return ;
}