View Code of Problem 4068

#include<stdio.h>
#include<string.h>
#include<stdlib.h>
#include<math.h>
#include<stdbool.h>
typedef struct{
	char name[20];
	int flag;
}Children;
int cmp(const void *a,const void *b){
	return *(int*)a-*(int*)b;
}
int main(){
	int n;
	int a[1010];
	int b[1010];
	while(scanf("%d",&n)!=EOF&&n!=0){
		for(int i=0;i<n;i++){
			scanf("%d",&a[i]);
		}
		for(int i=0;i<n;i++){
			scanf("%d",&b[i]);
		}
		qsort(a,n,sizeof(int),cmp);
		qsort(b,n,sizeof(int),cmp);
		int flag=0;
		int win=0;
		int equal=0;
		int defeat=0;
		
		for(int i=n-1;i>=0;i--){
			for(int j=n-1;j>=0;j--){
				if(a[i]>b[j]&&b[j]>=0){
					win++;
					b[j]=-2;
					break;
				}else if(a[i]==b[j]){
					equal++;
					b[j]=-1;
					break;
				}
			}
		}
//		for(int i=0;i<n;i++){
//			printf("%d ",b[i]);
//		}
//		printf("\n");
		defeat=n-equal-win;
		printf("%d\n",win-defeat);
	}
}