与田忌赛马类似,只不过多了一个平局的情况。
#include<iostream>
#include <memory.h>
#include <algorithm>
using namespace std;
int n;
int c[1005],s[1005];
int main()
{
while(cin >> n,n)
{
memset(c,0,sizeof(c));
memset(s,0,sizeof(s));
for(int i=0; i<n; i++)
cin >> c[i];
for(int i=0; i<n; i++)
cin >> s[i];
int sscore = 0,cscore = 0;
int chead =0,shead = 0,ctail = n-1,stail = n-1;
sort(c,c+n);
sort(s,s+n);
while(chead<=ctail)
{
if(s[stail]>c[ctail])
{
sscore+=3;
cs