Codeforces - 777B. Game of Credit Cards 贪心

最新推荐文章于 2019-03-16 21:16:41 发布

寒江雪里独钓着的蓑笠翁

最新推荐文章于 2019-03-16 21:16:41 发布

阅读量346

点赞数

分类专栏：贪心 Codeforces 文章标签：算法 acm codeforces

本文链接：https://blog.csdn.net/dragon60066/article/details/56926616

版权

Codeforces 同时被 2 个专栏收录

61 篇文章 2 订阅

订阅专栏

贪心

50 篇文章 0 订阅

订阅专栏

1.题目描述：

After the fourth season Sherlock and Moriary have realized the whole foolishness of the battle between them and decided to continue their competitions in peaceful game of Credit Cards.

Rules of this game are simple: each player bring his favourite n-digit credit card. Then both players name the digits written on their cards one by one. If two digits are not equal, then the player, whose digit is smaller gets a flick (knock in the forehead usually made with a forefinger) from the other player. For example, if n = 3, Sherlock's card is 123 and Moriarty's card has number 321, first Sherlock names 1and Moriarty names 3 so Sherlock gets a flick. Then they both digit 2 so no one gets a flick. Finally, Sherlock names 3, while Moriarty names 1 and gets a flick.

Of course, Sherlock will play honestly naming digits one by one in the order they are given, while Moriary, as a true villain, plans to cheat. He is going to name his digits in some other order (however, he is not going to change the overall number of occurences of each digit). For example, in case above Moriarty could name 1, 2, 3 and get no flicks at all, or he can name 2, 3 and 1 to give Sherlock two flicks.

Your goal is to find out the minimum possible number of flicks Moriarty will get (no one likes flicks) and the maximum possible number of flicks Sherlock can get from Moriarty. Note, that these two goals are different and the optimal result may be obtained by using different strategies.

Input

The first line of the input contains a single integer n (1 ≤ n ≤ 1000) — the number of digits in the cards Sherlock and Moriarty are going to use.

The second line contains n digits — Sherlock's credit card number.

The third line contains n digits — Moriarty's credit card number.

Output

First print the minimum possible number of flicks Moriarty will get. Then print the maximum possible number of flicks that Sherlock can get from Moriarty.

Note

First sample is elaborated in the problem statement. In the second sample, there is no way Moriarty can avoid getting two flicks.

2.题意概述：

两个人打牌，第一个人按牌顺序出，每轮胜者可以弹负者脑瓜崩，如果平局则无效，问你第二个人被弹的最小值和弹第一个人的最大值

首先是要弹第一个人的最大次数，那么对于第一个人出的每一张牌，第二个人应该贪心地找大于它牌最小的那张，如果没有则表示这轮他不可能获胜，则出最小牌就好了

然后是要被弹的最小次数，也是一样的，尽可能多的平局

3.AC代码：

#include <bits/stdc++.h>
#define INF 0x3f3f3f3f
#define maxn 100100
#define N 1111
#define eps 1e-6
#define pi acos(-1.0)
#define e 2.718281828459
#define mod (int)1e9 + 7
using namespace std;
typedef long long ll;
char a[N], b[N];
int vis1[10], vis2[10];
int main()
{
#ifndef ONLINE_JUDGE
	freopen("in.txt", "r", stdin);
	freopen("out.txt", "w", stdout);
	long _begin_time = clock();
#endif
	int n;
	while (~scanf("%d", &n))
	{
		scanf("%s%s", a, b);
		memset(vis1, 0, sizeof(vis1));
		memset(vis2, 0, sizeof(vis2));
		for (int i = 0; i < n; i++)
		{
			vis1[b[i] - '0']++;
			vis2[b[i] - '0']++;
		}
		int ans1 = 0, ans2 = 0;
		for (int i = 0; i < n; i++)
		{
			int x = a[i] - '0', flag = 0;
			for (int j = x; j < 10; j++)	//不被弹脑瓜崩
				if (vis1[j])
				{
					vis1[j]--;
					flag = 1;
					break;
				}
			if (!flag)
			{
				ans1++;
				for (int j = 0; j < x; j++)	// 只能被弹的话 出最小的牌
					if (vis1[j])
					{
						vis1[j]--;
						break;
					}
			}
			flag = 0;
			for (int j = x + 1; j < 10; j++)	//最大化弹别人
				if (vis2[j])
				{
					vis2[j]--;
					ans2++;
					flag = 1;
					break;
				}
			if (!flag)
			{
				for (int j = 0; j <= x; j++)	// 弹不了出最小牌
					if (vis2[j])
					{
						vis2[j]--;
						break;
					}
			}
		}
		printf("%d\n%d\n", ans1, ans2);
	}

#ifndef ONLINE_JUDGE
	long _end_time = clock();
	printf("time = %ld ms.", _end_time - _begin_time);
#endif
	return 0;
}