Minimize The Integer（贪心）

最新推荐文章于 2022-08-12 17:42:56 发布

喜欢蓝喜欢白

最新推荐文章于 2022-08-12 17:42:56 发布

阅读量288

点赞数 1

分类专栏： codeforces补题文章标签： c++ 算法 acm竞赛

本文链接：https://blog.csdn.net/qq_23334761/article/details/122456670

版权

codeforces补题专栏收录该内容

29 篇文章 1 订阅

订阅专栏

You are given a huge integer aa consisting of nn digits (nn is between 11 and 3⋅1053⋅105, inclusive). It may contain leading zeros.

You can swap two digits on adjacent (neighboring) positions if the swapping digits are of different parity (that is, they have different remainders when divided by 22).

For example, if a=032867235a=032867235 you can get the following integers in a single operation:

302867235302867235 if you swap the first and the second digits;
023867235023867235 if you swap the second and the third digits;
032876235032876235 if you swap the fifth and the sixth digits;
032862735032862735 if you swap the sixth and the seventh digits;
032867325032867325 if you swap the seventh and the eighth digits.

Note, that you can't swap digits on positions 22 and 44 because the positions are not adjacent. Also, you can't swap digits on positions 33 and 44 because the digits have the same parity.

You can perform any number (possibly, zero) of such operations.

Find the minimum integer you can obtain.

Note that the resulting integer also may contain leading zeros.

Input

The first line contains one integer tt (1≤t≤1041≤t≤104) — the number of test cases in the input.

The only line of each test case contains the integer aa, its length nn is between 11 and 3⋅1053⋅105, inclusive.

It is guaranteed that the sum of all values nn does not exceed 3⋅1053⋅105.

Output

For each test case print line — the minimum integer you can obtain.

input：

output：

0079
1337
234642

题意：给出一串数字，通过无限次交换数字位置，使得最后的数字最小。且每次交换只能奇数与偶数交换。最后数字可以有前导0.

解题思路：只有奇数和偶数可以交换，那么奇数与奇数之间的相对位置是不会改变的（偶数与偶数同理）。

因此把奇数和偶数分别存在两个队列中，逐一比较队头元素的大小，小者出队并输出即可。

核心代码：

int q1[N],q2[N],h1,h2,t1,t2;
void solve(){
	string s; cin >> s;
	h1 = h2 = 0;t1 = t2 = -1;
	for(int i = 0;i < s.size();i++){
		if((s[i] - '0') & 1){
			q1[++t1] = s[i] - '0';
		}else{
			q2[++t2] = s[i] - '0';
		}
	}
	while(h1 <= t1 && h2 <= t2){
		if(q1[h1] < q2[h2]){
			cout<< q1[h1++];
		}else{
			cout << q2[h2++];
		}
	}
	while(h1 <= t1) cout << q1[h1++];
	while(h2 <= t2) cout << q2[h2++];
	
	cout << endl;
}