暑期集训3:几何基础练习题G: HDU

2018学校暑期集训第三天——几何基础

练习题G —— HDU - 1052 (昨天加练题)

Tian Ji -- The 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.

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

Sample Output

200
0
0

#include<iostream>
#include<algorithm>
#include<cstdio>
using namespace std;int a[1010];
int b[1010];int main(void)
{int n;while(~scanf("%d", &n) && n!=0 ){for(int i=0;i<n;i++)scanf("%d", &a[i]);for(int i=0;i<n;i++)scanf("%d", &b[i]);sort(a, a+n);sort(b, b+n);int besta=n-1, bestb=n-1;int worsta=0, worstb=0;int sum = 0;while(besta >= worsta){if(a[besta] < b[bestb]){sum -= 200;bestb--;worsta++;}else if(a[besta] > b[bestb]){sum += 200;besta--;bestb--;}else if(a[besta] == b[bestb]){if(a[worsta] > b[worstb]){sum += 200;worsta++;worstb++;}else{    if(a[worsta] == b[bestb]){worsta++;bestb--;}else{sum -= 200;worsta++;bestb--;}}}}cout << sum << endl;}return 0;
}

暑期集训3:几何基础练习题G: HDU - 1052相关推荐

暑期集训3:几何基础练习题D: HDU - 2036
2018学校暑期集训第三天--几何基础练习题D -- HDU - 2036 改革春风吹满地 " 改革春风吹满地, 不会AC没关系; 实在不行回老家, 还有一亩三分地. 谢谢 ...
暑期集训3:几何基础练习题B: HDU - 2001
2018学校暑期集训第三天--几何基础练习题B -- HDU - 2001 计算两点间的距离输入两点坐标(X1,Y1),(X2,Y2),计算并输出两点间的距离. Input 输入数据有多组,每组 ...
暑期集训3:几何基础练习题A: HDU - 2002
2018学校暑期集训第三天--几何基础练习题A -- HDU - 2002 计算球体积根据输入的半径值,计算球的体积. Input 输入数据有多组,每组占一行,每行包括一个实数,表示球的半径 ...
暑期集训3:几何基础练习题H: POJ - 2456
2018学校暑期集训第三天--几何基础练习题H -- POJ - 2456 Aggressive cows Farmer John has built a new long barn, wit ...
暑期集训3:几何基础练习题F: CodeForces - 1007A
2018学校暑期集训第三天--几何基础练习题F -- CodeForces - 1007A Reorder the Array You are given an array of intege ...
暑期集训3:几何基础练习题C: POJ - 1269
2018学校暑期集训第三天--几何基础练习题B -- POJ - 1269 Intersecting Lines We all know that a pair of distinct point ...
暑期集训5:并查集线段树练习题G: HDU - 1754
2018学校暑期集训第五天--并查集线段树练习题G -- HDU - 1754 I Hate It 很多学校流行一种比较的习惯.老师们很喜欢询问,从某某到某某当中,分数最高的是多少. 这让 ...
暑期集训5:并查集线段树练习题F: HDU - 1166
2018学校暑期集训第五天--并查集线段树练习题F -- HDU - 1166 敌兵布阵 C国的死对头A国这段时间正在进行军事演习,所以C国间谍头子Derek和他手下Tidy又开始忙乎了.A ...
暑期集训5:并查集线段树练习题B: HDU - 1213
2018学校暑期集训第五天--并查集线段树练习题B -- HDU - 1213 How Many Tables Today is Ignatius' birthday. He invites ...

暑期集训3:几何基础练习题G: HDU - 1052

Tian Ji -- The Horse Racing

暑期集训3:几何基础练习题G: HDU - 1052相关推荐

最新文章

热门文章

暑期集训3:几何基础 练习题G: HDU - 1052

Tian Ji -- The Horse Racing

暑期集训3:几何基础 练习题G: HDU - 1052相关推荐

最新文章

热门文章

暑期集训3:几何基础练习题G: HDU - 1052

暑期集训3:几何基础练习题G: HDU - 1052相关推荐