UVALive 3266 Tian Ji -- The Horse Racing

UVALive 3266 Tian Ji – The Horse Racing

题目大意：田忌赛马，取最优方案

解题思路：大马比能赢就赢，赢不了让小马送

#include <stdio.h>
#include <iostream>
#include <stdlib.h>
using namespace std;
int cmd(const void *a, const void *b) {
    return (*(int*)a - *(int*)b);
}
int main() {
    int n;
    int a[1000], b[1000];
    while(cin >> n && n != 0) {
    for(int i = 0; i < n; i++)
        cin >> a[i];
    for(int i = 0; i < n; i++)
        cin >> b[i];
    qsort(a, n, sizeof(int), cmd);
    qsort(b, n, sizeof(int), cmd);
    int j1 = 0, j2 = 0;
    int i = n - 1, j = n - 1;
    int s = 0;
    for(int k = 0; k < n; k++) {
        if(a[i] > b[j]) {
            s++;
            i--;
            j--;
            continue;
        }
        if(a[j1] > b[j2]) {
            s++;
            j1++;
            j2++;
            continue;
        }
        if(a[j1] < b[j]) {
            s--;
        }
        j1++;
        j--;

    }
    long long int all = s * 200;
    printf("%lld\n", all);
    }
    return 0;
}