# Educational Codeforces Round 87 (Rated for Div. 2) D. Multiset

Note that the memory limit is unusual.

You are given a multiset consisting of n integers. You have to process queries of two types:

add integer k into the multiset;
find the k-th order statistics in the multiset and remove it.
k-th order statistics in the multiset is the k-th element in the sorted list of all elements of the multiset. For example, if the multiset contains elements 1, 4, 2, 1, 4, 5, 7, and k=3, then you have to find the 3-rd element in [1,1,2,4,4,5,7], which is 2. If you try to delete an element which occurs multiple times in the multiset, only one occurence is removed.

After processing all queries, print any number belonging to the multiset, or say that it is empty.

Input
The first line contains two integers n and q (1≤n,q≤106) — the number of elements in the initial multiset and the number of queries, respectively.

The second line contains n integers a1, a2, …, an (1≤a1≤a2≤⋯≤an≤n) — the elements of the multiset.

The third line contains q integers k1, k2, …, kq, each representing a query:

if 1≤ki≤n, then the i-th query is “insert ki into the multiset”;
if ki<0, then the i-th query is “remove the |ki|-th order statistics from the multiset”. For this query, it is guaranteed that |ki| is not greater than the size of the multiset.
Output
If the multiset is empty after all queries, print 0.

Otherwise, print any integer that belongs to the resulting multiset.

Examples
inputCopy
5 5
1 2 3 4 5
-1 -1 -1 -1 -1
outputCopy
0
inputCopy
5 4
1 2 3 4 5
-5 -1 -3 -1
outputCopy
3
inputCopy
6 2
1 1 1 2 3 4
5 6
outputCopy
6
Note
In the first example, all elements of the multiset are deleted.

In the second example, the elements 5, 1, 4, 2 are deleted (they are listed in chronological order of their removal).

In the third example, 6 is not the only answer.


int lowbit(int x) {
return x&(-x);
}
int c[100050],a[100050];
while(x<N)
c[x]+=v,x+=lowbit(x);
}
int query(int x) {
int sum=0;
while(x)
sum+=c[x],x-=lowbit(x);
return sum;
}
int main() {
int n,q,x;
for(int i=1; i<=n; i++) {
}
while(q--) {
if(x>=1) {
} else {
x=-x;
int l=1,r=n,m;
int res;
while(l<=r) {
m=(l+r)>>1;
if(query(m)>=x)
res=m,r=m-1;
else
l=m+1;
}

}
}
int ans=0;
for(int i=1; i<=n; i++)
if(query(i)>0) {
ans=i;
break;
}
cout<<ans<<endl;
return 0;
}



10-26 873

01-15 159

03-24 137

05-18 29

11-14 53

05-17 251

07-15 1132

03-25 149

07-17 1000

12-29 25

05-18 74

05-18 70

05-20 42

08-23 611

05-18 53

04-11 68

08-04 123

03-10 65

12-29 55

01-15 592

07-08 133

02-01 122

06-16 93

04-14 58万+

03-13 14万+

03-01 13万+

03-04 13万+

03-08 4万+

03-08 7万+

04-25 6万+

03-10 13万+

03-12 11万+

03-13 11万+

03-14 1万+

03-18 9459

03-19 3万+

03-19 8万+

03-19 3万+

03-22 4万+

03-24 3万+

03-25 3万+

05-08 5万+

03-25 9万+

03-27 1万+

03-29 21万+

03-29 10万+

03-30 16万+

05-28 5808

05-28 1万+

04-02 4179

04-02 4万+

04-06 7万+

04-09 8万+

04-09 2万+

05-17 8147

04-11 3万+

04-15 6万+

04-18 4万+

04-20 4万+

04-24 3万+

04-29 6864

04-30 9818

04-30 9392

05-01 5734

05-03 1万+

05-16 5万+

05-06 1万+

05-08 4万+

05-10 3137

05-14 6202

05-14 1832

05-16 3436

05-16 1万+

05-20 853

05-18 8171

05-27 1132

05-18 3390

05-19 1万+

05-21 6825

#### 石锤！今年Python要过苦日子了？ 程序员：我疯了！

©️2019 CSDN 皮肤主题: 精致技术 设计师: CSDN官方博客