# Tian Ji -- The Horse Racing

Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 5595 Accepted Submission(s): 1337

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

1、田忌的马优于国王的马

2、田忌的马劣于国王的马

3、田忌的马和国王马一样

AC代码：

#include<stdio.h>
#include<string.h>
#include<math.h>
#include<vector>
#include<set>
#include<map>
#include<algorithm>
using namespace std;
#define Pai 3.1415926

int main()
{
int tol,i,j,tian[1100],king[1100],sum;
while(~scanf("%d",&tol))
{
sum=0;
if(tol==0)
break;
for(i=0;i<tol;i++)
scanf("%d",&tian[i]);
for(i=0;i<tol;i++)
scanf("%d",&king[i]);
sort(tian,tian+tol);
sort(king,king+tol);//从小到大排序
for(i=0;i<tol;i++)
{
if(tian[i]>king[i])//第一种情况，田忌的马比国王的马要优等
{
sum++;//赢一局
}
else if(tian[i]<king[i])//第二种情况，田忌的马比国王的马要劣等
{
sum--;//因为已排好序，比国王最劣等的马还要差，这一匹马去比赛肯定是要输掉的，就拿这匹马和国王最好的马比赛
for(j=tol-1;j>i;j--)//移掉国王最好的一匹马
king[j]=king[j-1];
}
else if(tian[i]==king[i])//第三种情况，田忌的马和国王的马一样
{//此时需倒着比较最好的马
if(tian[tol-1]>king[tol-1])//若最好的马优于国王的马
{
sum++;//赢一局
for(j=tol-1;j>i;j--)
{
tian[j]=tian[j-1];
king[j]=king[j-1];
}
}
else if(tian[tol-1]<king[tol-1])//若最好的马劣于国王的马
{
sum--;//国王这批最好的马必赢，输一局先，拿最差的那匹马去比
for(j=tol-1;j>i;j--)
{
king[j]=king[j-1];
}
}
else if(tian[tol-1]==king[tol-1])//若相等
{
if(tian[i]<king[tol-1])//看田忌最差的马和国王最好的马，想等就平局，要劣势就先拿这匹马输一局
{
sum--;
for(j=tol-1;j>i;j--)
{
king[j]=king[j-1];
}
}
}
}
}
printf("%d\n",sum*200);
}
return 0;
}

#### 田忌赛马（Tian Ji -- The Horse Racing）中的动态规划以及贪心算法

2012-09-20 20:58:16

#### hdu 1052（田忌赛马详解）Tian Ji -- The Horse Racing

2017-01-20 16:54:48

#### ACM--田忌赛马--贪心--HDOJ 1052--Tian Ji -- The Horse Racing

2016-05-29 16:54:11

#### TCO Beijing 热身(Tian Ji's Horse Racing)

2018-05-26 14:28:15

#### hdu 1052 Tian Ji -- The Horse Racing 贪心算法

2012-10-05 22:49:28

#### hdu1052 Tian Ji -- The Horse Racing 贪心

2014-06-24 14:39:51

#### 【贪心】[hdu1052]Tian Ji -- The Horse Racing(田忌赛马)[c++]

2017-03-06 18:24:19

#### Tian Ji -- The Horse Racing **

2017-08-25 08:52:15

#### hdu 1052 Tian Ji -- The Horse Racing（很好的贪心）

2012-05-07 22:26:46

#### 经典田忌赛马算法JAVA解决代码

2017-09-11 19:44:40