Minimum Ternary String（思维）

B. Minimum Ternary String

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

You are given a ternary string (it is a string which consists only of characters '0', '1' and '2').

You can swap any two adjacent (consecutive) characters '0' and '1' (i.e. replace "01" with "10" or vice versa) or any two adjacent (consecutive) characters '1' and '2' (i.e. replace "12" with "21" or vice versa).

For example, for string "010210" we can perform the following moves:

• "010210" $\to$ "100210";
• "010210" $\to$ "001210";
• "010210" $\to$ "010120";
• "010210" $\to$ "010201".

Note than you cannot swap "02" $\to$ "20" and vice versa. You cannot perform any other operations with the given string excluding described above.

You task is to obtain the minimum possible (lexicographically) string by using these swaps arbitrary number of times (possibly, zero).

String $a$ is lexicographically less than string $b$ (if strings $a$ and $b$ have the same length) if there exists some position $i$ ($1\le i\le |a|$, where $|s|$ is the length of the string $s$) such that for every $j<i$ holds $a_j=b_j$, and $a_i<b_i$.

Input

The first line of the input contains the string $s$ consisting only of characters '0', '1' and '2', its length is between $1$ and ${10}^5$ (inclusive).

Output

Print a single string — the minimum possible (lexicographically) string you can obtain by using the swaps described above arbitrary number of times (possibly, zero).

Examples

input

Copy

100210

output

Copy

001120

input

Copy

11222121

output

Copy

11112222

input

Copy

20

output

Copy

20

【题解】

题意：交换01或12使字符串字典序最小。

思路：1既可以跟0交换也可以跟2交换，可理解为1在字符串中任意移动使字符串字典序最小。第一个2后边的0和2的次序无法变动，前边的次序一定是0在1前边，而所有的1都在第一个2前边。

【代码】

#include<bits/stdc++.h>
using namespace std;
int main()
{
    string a;
    while(cin>>a)
    {
        int i,j,c1=0,c2=0,f=1;
        for(i=0;i<a.size();i++)
        {
            if(f&&a[i]=='0')
                c1++;
            else if(a[i]=='1')
                c2++;
            else if(f&&a[i]=='2')
            {
                f=0;
                j=i;
            }
        }
        for(i=0;i<c1;i++)
            cout<<'0';
        for(i=0;i<c2;i++)
            cout<<'1';
        for(i=j;i<a.size();i++)
            if(a[i]!='1')
                cout<<a[i];
        cout<<endl;
    }
    return 0;
}