hdu 1052 horse racing(贪心算法)

问题描述：

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.

输入：

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.

输出：

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

样本输入：

3

92 83 71

95 87 74

2

20 20

20 20

2

20 19

22 180

样本输出：

  
  

   
   200
0
0
  
  
  
  


  
  

问题解析：

1、当田忌最快的马大于大王最快的马时，果断赢一场，即用最小的差距 去赢大王的马
2、当田忌最快的马小于大王最快的马时，这肯定是必败的结果，则用田忌最慢的马来败这场，这就是贪心算法的思想
3、当田忌最快的马与大王最快的马相等时，即平局时就要考虑三种情况
    1、当田忌最慢的马比大王最慢的马快时 果断赢这场比赛，这是用最小的代价赢
    2、当田忌最慢的马比大王的最慢的马慢时，必输的话 肯定要带上大王最快的马
    3、当田忌最慢的马与大王最慢的马相等时
        也要考虑田忌最慢的马可能小于大王最快的马 必败时打上大王最快的马
        还有一种情况是田忌最慢的马与大王最快的马平局  则不存在打败的情况

代码：

#include<iostream>
#include<cstdlib>
using namespace std;
int cmp(const void *a,const void *b)
{
return *(int *)b-*(int *)a;
}
int main()
{
int n;
while(cin>>n && n!=0)
{
   int i,j,t,s,win=0;
int T[1000],K[1000];
for(i=0;i<n;i++)
{
cin>>T[i];
}
for(i=0;i<n;i++)
{
cin>>K[i];
}
qsort(T,n,sizeof(T[0]),cmp);//对输入的进行降序排列 便于后面一对一的比较处理
qsort(K,n,sizeof(K[0]),cmp);
i=0,j=0,t=n-1,s=n-1;
while(i<=t)
{
            if(T[i]>K[j])
{
win++;
i++,j++;//就是田忌赢时，即大王败时，大王的代价必须是最大的，赢时差距最小的
}
else if(T[i]<K[j])
{
win--;
t--,j++;//就是田忌败时 则那最慢的马败给大王
}
else 
{
//就是平局时又要考虑三种情况
if(T[t]<K[s])
{
t--,j++;//必败的情况下 要带上大王最快的马，拒绝平局
win--;
}
else if(T[t]>K[s])
{
t--,s--;//必败的情况下 要带上大王最快的马，拒绝平局
win++;
}
else
{
if(T[t]<K[j])
{
t--,j++;
   win--;//拒绝平局，此时应拿田忌最慢的马去赢大王最快的马
}
else
{
t--,j++;//这里一定要注意看 田忌最慢的马有可能与大王最快的马相等
}

}

}


}
cout<<win*200<<endl;
}
return 0;
}