HDU 2019 Fighting for HDU（贪心水题）

#include <iostream>
using namespace std;
#include <string.h>
#include <stdio.h>
#include <queue>
#include <algorithm>
#define m 300040
typedef long long LL;
int main()
{
int n;
while( scanf ( "%d", &n ) != EOF )
{
if( n == 0 ) break;
int hdu[120],d[120];
for( int i = 0 ; i < n ; i ++ )
scanf ( "%d", &hdu[i] );
for( int i = 0 ; i < n ; i ++ )
scanf ( "%d", &d[i] );
sort( hdu, hdu+n );
sort( d, d+n );
int h = 0, dx = 0;
for( int i = 0; i < n; i ++ )
{
if( hdu[i] > d[i] ) h+=2;
else if( hdu[i] < d[i] ) dx+=2;
else {
dx++;h++;
}
}
printf("%d vs %d\n",h,dx);
}
return 0;
}