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, 3and 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.
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.
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.
3 123 321
0 2
2 88 00
2 0
First sample is elaborated in the problem statement. In the second sample, there is no way Moriarty can avoid getting two flicks.
【题解】 贪心题,如果第一个人的数字小于第二个人的数字,那么第一个人就会被敲一下,否则第二个人就会被敲一下,第一个人比较诚实,卡片上的数字顺序是不变的,而第二个人为了得到更少的敲打,打算作弊,即将卡片的数字顺序修改,比如样例123和321,这种情况下他们二人都会得到一下敲打,而如果第二个人吧牌换成231,那么第一个人就会得到两下敲打而他自己得到一下,第二个人卡片上的数字是不变的(顺序可以变)。
【AC代码】
#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cstring>
using namespace std;
int main()
{
std::ios::sync_with_stdio(false);
int m,n,x,y;
char s1[1005],s2[1005];
cin>>m;
cin>>s1>>s2;
sort(s1,s1+m);
sort(s2,s2+m);
x=y=0;
for(int i=0,j=0;i<m;++i)
{
if(s2[i]>=s1[j])
{
j++;
}
else x++;
}
for(int i=m-1,j=m-1;i>=0;--i)
{
if(s2[j]>s1[i])
{
j--;
y++;
}
}
cout<<x<<endl<<y<<endl;
return 0;
}