hdu 1052 Tian Ji -- The Horse Racing

Tian Ji -- The Horse Racing
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 29464 Accepted Submission(s): 8861


Problem Description
Here is a famous story in Chinese history.

"That was about 2300 years ago. General Tian Ji was a high official in the country Qi. He likes to play horse racing with the king and others."

"Both of Tian and the king have three horses in different classes, namely, regular, plus, and super. The rule is to have three rounds in a match; each of the horses must be used in one round. The winner of a single round takes two hundred silver dollars from the loser."

"Being the most powerful man in the country, the king has so nice horses that in each class his horse is better than Tian's. As a result, each time the king takes six hundred silver dollars from Tian."

"Tian Ji was not happy about that, until he met Sun Bin, one of the most famous generals in Chinese history. Using a little trick due to Sun, Tian Ji brought home two hundred silver dollars and such a grace in the next match."

"It was a rather simple trick. Using his regular class horse race against the super class from the king, they will certainly lose that round. But then his plus beat the king's regular, and his super beat the king's plus. What a simple trick. And how do you think of Tian Ji, the high ranked official in China?"



Were Tian Ji lives in nowadays, he will certainly laugh at himself. Even more, were he sitting in the ACM contest right now, he may discover that the horse racing problem can be simply viewed as finding the maximum matching in a bipartite graph. Draw Tian's horses on one side, and the king's horses on the other. Whenever one of Tian's horses can beat one from the king, we draw an edge between them, meaning we wish to establish this pair. Then, the problem of winning as many rounds as possible is just to find the maximum matching in this graph. If there are ties, the problem becomes more complicated, he needs to assign weights 0, 1, or -1 to all the possible edges, and find a maximum weighted perfect matching...

However, the horse racing problem is a very special case of bipartite matching. The graph is decided by the speed of the horses --- a vertex of higher speed always beat a vertex of lower speed. In this case, the weighted bipartite matching algorithm is a too advanced tool to deal with the problem.

In this problem, you are asked to write a program to solve this special case of matching problem.


Input
The input consists of up to 50 test cases. Each case starts with a positive integer n (n <= 1000) on the first line, which is the number of horses on each side. The next n integers on the second line are the speeds of Tian’s horses. Then the next n integers on the third line are the speeds of the king’s horses. The input ends with a line that has a single 0 after the last test case.


Output
For each input case, output a line containing a single number, which is the maximum money Tian Ji will get, in silver dollars.


Sample Input

3
92 83 71
95 87 74
2
20 20
20 20
2
20 19
22 18
0



Sample Output

200
0
0

题意：田忌赛马的故事。每次比赛都有二百两银子的奖励，问田忌最多可获得多少银子？

思路：这其实就是贪心的思想，既然是让求田忌可获得最多的价值是多少，那么我就尽可能的让田忌赢不就可以了。  那么首先我们要比较第一匹马的速度（要按照从大到进行一次排序），如果是田忌的快，那么就这两匹马进行比赛（下标随之往后移动），如果是国王的马快，那么我在比较最后一匹马（也就是速度最慢的）的马，如果是田忌的快，那么就这两匹马比赛（下标随之往前移动），如果是国王的快，那么我就拿最慢的马去和国王最快的马比赛（下标随之移动），这样的话我可以保证田忌最快的马一定可以赢。

刚开始的位置如图所示：

经过第一步比较：如果田忌的马比过往的快，下标往后移动。如图：

如果田忌的马慢的话，那么就比较最慢的马，如果田忌最慢的马比国王最慢的马快，那么下标随之往前移动。如图：

如果田忌最慢的马比国王最慢的马还慢的话，那么我就拿田忌最慢的马去和国王最快的马比较。下标随之移动，如图：

总而言之就是找到田忌比国王慢的马，然后拿这匹慢马去和国王快的马比，这样就能满足田忌赢得次数最多。

AC代码：

#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
bool cmp(int x, int y)
{
    return x > y;
}
int main()
{
    int n;
    while(~scanf("%d",&n)&&n)
    {
        int King[3001], Tian[3001];
        int t = 0;
        for(int i = 0; i < n; i++)
        {
            scanf("%d",&Tian[i]);
        }
        for(int i = 0; i < n; i++)
        {
            scanf("%d",&King[i]);
        }
        sort(Tian, Tian + n, cmp);
        sort(King, King + n, cmp);
        int s1 = 0, s2 = 0;
        int e1 = n - 1, e2 = n - 1;
        int sum = 0;
        while(n--)
        {
            if(Tian[s1] > King[s2])   ///田忌最快的马比国王最快的马快
            {
                s1++, s2++;
                sum++;
            }
            else if(Tian[e1] > King[e2])        ///田忌最慢的马比国王最慢的马快
            {
                e1--, e2--;
                sum++;
            }
            else if(Tian[e1] < King[s2])        ///田忌最慢的马比国王最快的慢
            {
                e1--, s2++;
                sum--;
            }
        }
        printf("%d\n",sum*200);
    }

    return 0;
}