第五届山东省赛J--Weighted Median

For n elements x1, x2, ..., xn with positive integer weights w1, w2, ..., wn. The weighted median is the element xk satisfying  
 and     , S indicates   

Can you compute the weighted median in O(n) worst-case?

Input

There are several test cases. For each case, the first line contains one integer n(1 ≤  n ≤ 10^7) — the number of elements in the sequence. The following line contains n integer numbers xi (0 ≤ xi ≤ 10^9). The last line contains n integer numbers wi (0 < wi < 10^9).

Output

One line for each case, print a single integer number— the weighted median of the sequence.

Sample Input

7
10 35 5 10 15 5 20
10 35 5 10 15 5 20

Sample Output

20

#include<stdio.h>
#include<algorithm>
using namespace std;
struct e
{
    int x,w;
}a[10000000+10];
int cmp(e a,e b)
{
    return  a.x<b.x;
}

int main()
{
    int n,i,j;
    while(scanf("%d",&n)!=EOF)
    {long long s=0;
    for(i=1;i<=n;i++)
        scanf("%d",&a[i].x);
    for(i=1;i<=n;i++)
        {scanf("%d",&a[i].w);s+=a[i].w;}

    sort(a+1,a+1+n,cmp);
   // for(i=1;i<=n;i++)
        //printf("%d %d\n",a[i].x,a[i].w);

    long long sum1=0,sum2,ts=s/2;
    a[0].w=0;
    for(i=1;i<=n;i++)
    {   int t=a[i].w;
        sum1+=a[i-1].w;
        sum2=s-sum1-t;

    //printf("%d %d\n",sum1,sum2);
        if(sum1<ts&&sum2<=ts) {printf("%d\n",a[i].x);break;}
    }
}
}