Minimal string

题目：

Petya recieved a gift of a string s with length up to 105 characters for his birthday. He took two more empty strings t and u and decided to play a game. This game has two possible moves:

• Extract the first character of s and append t with this character.
• Extract the last character of t and append u with this character.

Petya wants to get strings s and t empty and string u lexigraphically minimal.

You should write a program that will help Petya win the game.

Input

First line contains non-empty string s (1 ≤ |s| ≤ 105), consisting of lowercase English letters.

Output

Print resulting string u.

Examples

input

cab

output

abc

input

acdb

output

abdc

题意：有字符串a,b,c;每次从字符串a的头取元素加到b上，b可以取元素到C，求怎样让c最小，并且输出c；

思路：栈模拟+贪心

坑点：我一开始用char存字符各种超时，改成string就好了。

代码：

#include <bits/stdc++.h>
using namespace std;
int r[30];//存字母
vector<int>ans;
stack<int>s;
int i,j;
int main()
{
    int flag;
    for(i=0;i<30;i++) r[i]=0;
    string c;
    int b[100010];
    cin>>c;
    for(i=0;i<c.size();i++) r[b[i]=c[i]-'a']++;

    for(i=0;i<c.size();i++){
        s.push(b[i]);r[b[i]]--;
        flag=0;
        while(!s.empty()){
            for(j=s.top()-1;j>=0;j--)
                if(r[j])
                    flag=1;

            if(flag==1)
                break;
            ans.push_back(s.top());
            s.pop();
        }
    }

    for(i=0;i<ans.size();i++)
        printf("%c",ans[i]+'a');
}