hdu 1052 Tian Ji – The Horse Racing
添加链接描述
#include <bits/stdc++.h>
using namespace std;
#define MXN 1010
int n, t[MXN], k[MXN];
int main(){
while(scanf("%d", &n)){
if(n == 0) break;
for(int i = 1; i <= n; i++) scanf("%d", t+i);
for(int i = 1; i <= n; i++) scanf("%d", k+i);
sort(t+1, t+n+1, [](int x, int y){ return x > y; });
sort(k+1, k+n+1, [](int x, int y){ return x > y; });
int th = 1, tt = n, kh = 1, kt = n;
int w = 0, d = 0, l = 0;
while(w + d + l < n){
if(t[tt] < k[kt]) kh++, tt--, l++;
else if(t[th] > k[kh]) kh++, th++, w++;
else if(t[th] < k[kh]) kh++, tt--, l++;
else if(t[tt] > k[kt]) tt--, kt--, w++;
else{
if(k[kh] > t[tt]) l++;
else if(k[kh] < t[tt]) w++;
else d++;
kh++, tt--;
}
}
printf("%d\n", (w-l)*200);
}
return 0;
}