Weighted Median
Time Limit: 2000 ms Memory Limit: 65536 KiB
Submit Statistic Discuss
Problem Description
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
题解:每个数据对应一个权值,从头加直到到达总值的1/2。就是先算总值,在排序相加,另其达到总值的1/2。
#include<iostream>
#include<cstdio>
#include<cstring>
#include<cmath>
#include <iomanip>
#include<algorithm>
using namespace std;
const int N=1e7+10;
struct node
{
int x;
int w;
} s[N];
long long cmp(node a,node b)
{
return a.x<b.x;
}
int main()
{
ios::sync_with_stdio(false);
int n,i;
long long sum,s1;
while(cin>>n)
{
sum=0;
for(i=0; i<n; i++)
cin>>s[i].x;
for(i=0; i<n; i++)
{
cin>>s[i].w;
sum+=s[i].w;
}
sort(s,s+n,cmp);
s1=0;
for(i=0;; i++)
{
s1+=s[i].w;
if(s1>=sum/2.0)
break;
}
cout<<s[i].x<<endl;
}
return 0;
}