Codeforces 982B (优先队列)

传送门

题面：

B. Bus of Characters

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

In the Bus of Characters there are $n$ rows of seat, each having $2$ seats. The width of both seats in the $i$-th row is $w_i$ centimeters. All integers $w_i$ are distinct.

Initially the bus is empty. On each of $2n$ stops one passenger enters the bus. There are two types of passengers:

• an introvert always chooses a row where both seats are empty. Among these rows he chooses the one with the smallest seats width and takes one of the seats in it;
• an extrovert always chooses a row where exactly one seat is occupied (by an introvert). Among these rows he chooses the one with the largest seats width and takes the vacant place in it.

You are given the seats width in each row and the order the passengers enter the bus. Determine which row each passenger will take.

Input

The first line contains a single integer $n$ ($1\le n\le 200000$) — the number of rows in the bus.

The second line contains the sequence of integers $w_1,w_2,\dots ,w_n$ ($1\le w_i\le {10}^9$), where $w_i$ is the width of each of the seats in the $i$-th row. It is guaranteed that all $w_i$ are distinct.

The third line contains a string of length $2n$, consisting of digits '0' and '1' — the description of the order the passengers enter the bus. If the $j$-th character is '0', then the passenger that enters the bus on the $j$-th stop is an introvert. If the $j$-th character is '1', the the passenger that enters the bus on the $j$-th stop is an extrovert. It is guaranteed that the number of extroverts equals the number of introverts (i. e. both numbers equal $n$), and for each extrovert there always is a suitable row.

Output

Print $2n$ integers — the rows the passengers will take. The order of passengers should be the same as in input.

Examples

input

Copy

2
3 1
0011

output

Copy

2 1 1 2 

input

Copy

6
10 8 9 11 13 5
010010011101

output

Copy

6 6 2 3 3 1 4 4 1 2 5 5 

Note

In the first example the first passenger (introvert) chooses the row $2$, because it has the seats with smallest width. The second passenger (introvert) chooses the row $1$, because it is the only empty row now. The third passenger (extrovert) chooses the row $1$, because it has exactly one occupied seat and the seat width is the largest among such rows. The fourth passenger (extrovert) chooses the row $2$, because it is the only row with an empty place.

题目描述：

    有n行的椅子，每行有两个椅子，第i行的椅子的宽度为wi。

    第二行输入一个长度为2*n字符串，代表两种人，0表示第一种人，他们只会选择坐在一行没人的位子上，如果有多个地方满足条件，他会选择宽度最小的凳子；1表示第一种人，他们只会选择在坐在一行有一个人坐的位子上，如果有多个地方满足条件，则他们会优先选择宽度最大的凳子。询问这2*n个人分别坐在在哪一行。

题目分析：

    因为我们知道，1这类人一定是要坐在有一个人的地方的，因此，我们可以分析到，第一个坐下的必定是0的人。因为他们每次要坐在宽度最小的凳子上，因此我们在这里可以建立一个小根堆，每次遇到0的时候就将堆顶元素pop出；同时，因为这个人坐下后，导致了这个凳子可以被1这类人所坐，（而这类人要坐在宽度最大的凳子上）因此我们可以再建立一个大根堆，每次pop掉小根堆的元素后，将该元素再push进大根堆，当遇到1的时候再pop出大根堆堆顶元素即可。

代码:

#include <bits/stdc++.h>
#define maxn 200005
using namespace std;
typedef pair<int,int>PLL;
int main()
{
    priority_queue<PLL,vector<PLL>,greater<PLL> >que0;
    priority_queue<PLL>que1;
    int n;
    cin>>n;
    for(int i=1;i<=n;i++){
        int tmp=0;
        cin>>tmp;
        que0.push(PLL(tmp,i));
    }
    string str;
    cin>>str;
    int len=str.length();
    for(int i=0;i<len;i++){
        if(str[i]=='0'){
            if(i==0){
                cout<<que0.top().second;
                que1.push(que0.top());
                que0.pop();
            }
            else{
                cout<<" "<<que0.top().second;
                que1.push(que0.top());
                que0.pop();
            }
        }
        else{
            cout<<" "<<que1.top().second;
            que1.pop();
        }
    }
    return 0;
}