Tian Ji -- The Horse Racing

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
问题描述

这是中国历史上一个著名的故事。

那是大约2300年前的事了。田忌将军是齐国的一位高官。他喜欢和国王以及其他人一起赛马。”

田和国王都有三匹马，它们属于不同的等级，分别是普通马、加号马和超级马。比赛规则是一场比赛要打三轮;每匹马必须用一轮。赢了一局的人可以从输的人那里得到200银元。”

“作为这个国家最有权势的人，国王有这么多好马，每个等级的马都比田的好。因此，每一次，国王从田那里得到六百元银币。”

田忌对此很不高兴，直到他遇见了孙膑，中国历史上最著名的将军之一。田忌对孙杨耍了一个小花招，在下场比赛中为孙杨带回了200块银元和一份厚爱。”

这是一个相当简单的把戏。用他的常规职业和来自国王的超级职业比赛，他们肯定会输掉这一轮。但是他的加号打败了国王的正号，他的超级超级打败了国王的加号。多么简单的把戏。你觉得中国的高官田忌怎么样?”

如果田忌生活在现在，他一定会自嘲。甚至，如果他现在参加ACM竞赛，他可能会发现赛马问题可以简单地看作是在二分图中找到最大匹配。把田的马画在一边，把王的马画在另一边。每当田的马能打败国王的马，我们就在它们之间画一条边，这意味着我们希望建立这一对。然后，尽可能多赢几轮的问题就是在这个图中找到最大匹配。如果存在平手，问题就会变得更加复杂，他需要给所有可能的边分配0、1或-1的权值，并找到一个最大权值的完美匹配……

然而，赛马问题是二部匹配的一个非常特殊的例子。这个图形是由马的速度决定的——一个速度高的顶点总是击败一个速度低的顶点。在这种情况下，加权二分图匹配算法是一个过于先进的工具来处理这个问题。

在这个问题中，你被要求写一个程序来解决这个特殊情况下的匹配问题。

输入

输入由多达50个测试用例组成。每种情况都从第一行的正整数n (n <= 1000)开始，这是每边的马的数量。第二行的下n个整数是田的马的速度。接下来的n个整数在第三行是国王的马的速度。输入以最后一个测试用例之后的一个0结束。

输出

对于每个输入情况，输出一行包含一个数字，这是天机将得到的最大金额，以银元表示。

样例输入

92 83 71

95 87 74

2

20个20

20个20

2

20日19

22日18

0

样例输出

200

0

0

贪心算法
算法分析

Problem Description：给出2N组数据，分别表示田忌和齐威王的N匹马的速度，没进行一场比赛（每组数据共N场场赛），若能分出胜负，则输的一方要给赢的一方200Y￥（银元），求田忌以怎样的策略才能赚取最多的老婆本。

Solution：这题有多种解体思路，DP，二分图最大匹配算法等，这里给出的是比较容易理解的贪心算法，具体思路如下：

先将田忌跟齐王的马的速度数组进行一次冒泡排序

1、如果田忌最快的马比齐王最快的马快，则比之

2、如果田忌最快的马比齐王最快的马慢，则用田最慢的马跟齐最快的马比 //这是贪心的第一步

3、如果田忌最快的马的速度与齐威王最快的马速度相等

3.1、如果田忌最慢的比齐威王最慢的快，则比之 //这是贪心的第二步

3.2、如果田忌最慢的比齐威王最慢的慢，田忌慢VS齐王快

3.3、田忌最慢的与齐威王最慢的相等，田忌慢VS齐王快

注意这两种 数据

3

1 2 3

928371 tian 第一步 tian1对king1 转到2 贪心的第一次，

95 9274king 第二步tian1对king2 转到3.1 （贪心的第二次 保留tian的快马 ）

             第三步 只剩下一种选择了~~

3
92 83 70
92 91 60
代码如下
#include<stdio.h>
#include
#include
using namespace std;
int a[3000],b[3000];
int cmp(int a,int b)
{
return a>b;
}
int main()
{
int i,n,j,sum,k,f,ji;
while( scanf("%d",&n) && n!=0 )
{
for(i=0;i<n;i++)
scanf("%d",&a[i]);
for(i=0;i<n;i++)
scanf("%d",&b[i]);
sort(a,a+n,cmp);
sort(b,b+n,cmp);
ji=0; // 记录 king 比赛用的马 循环跳出的判定条件
i=j=sum=0;
k=n-1;
f=n-1;
while(1)
{
if(ji==n) break; // king 的马全部比完后跳出
if(b[j]>a[i]) { sum-=200;j++;k–;ji++; continue;} //如果king的比tian的快马快 用tian的慢马对king的快马
if(b[j]==a[i]){ //如果相等
if(b[f]<a[k]){f–;k–;sum+=200;ji++;continue;} //看两人的慢马 tian的慢马比king的慢马快则比
if(b[j]>a[k]){sum-=200;k–;j++;ji++;}
else {k–;j++;ji++;}
continue;
}
if(b[j]<a[i]){sum+=200;j++;i++;ji++;continue;} //如果tian的比king的快马快 直接比
}
printf("%d\n",sum);
}
}