1198 渊子赛马(贪心算法)

#include<stdio.h>
int main() {
    int h,n,temp,i,j,k,l,a[15],b[15],sum,point=0;

    while(1) {
        scanf("%d",&n);
        if(n==0) {
            break;
        }
        //data in array
        for(i=0; i<n; i++) {
            scanf("%d",&a[i]);
        }
        for(i=0; i<n; i++) {
            scanf("%d",&b[i]);
        }
        //sort a
        for (i = 0; i < n-1; i++) {
            for (j = 0; j < n-1-i; j++) {
                if (a[j] > a[j+1]) {
                    temp = a[j];
                    a[j] = a[j+1];
                    a[j+1] = temp;
                }
            }
        }
        //sort b
        for (i = 0; i < n-1; i++) {
            for (j = 0; j < n-1-i; j++) {
                if (b[j] > b[j+1]) {
                    temp = b[j];
                    b[j] = b[j+1];
                    b[j+1] = temp;
                }
            }
        }
        //house num
        h=0;
        i=j=0;//good index
        k=l=n-1;//bad index
        while(1) {
            if(h==n) { //all house run
                break;
            }
            if(b[j]>a[i]) {
                point--;
                j++;//next good house
                k--; //next bad house
                h++;//run a house
                continue;
            }
            if(b[j]==a[i]) {
                if(b[l]<a[k]) {
                    point++;
                    l--;
                    k--;
                    h++;
                    continue;
                }
                if(b[j]>a[k]) {
                    point--;
                    k--;
                    j++;
                    h++;
                    continue;
                } else {
                    //bad win good
                    k--;
                    j++;
                    h++;
                }
                continue;
            }
            if(b[j]<a[i]) {
                point++;
                j++;
                i++;
                h++;
                continue;
            }
        }
        if(point>=0) {
           printf("YES\n");
        }else{
            printf("NO\n");
        }

    }
    return 0;
}