SOL
看起来是变成了二维,其实仔细观察会发现两维的坐标是独立的,于是分别对两个维度求一次带权中位数即可
代码:
#include<bits/stdc++.h>
using namespace std;
#define re register
#define int long long
inline int rd(){
int re data=0;static char ch=0;ch=getchar();
while(!isdigit(ch))ch=getchar();
while(isdigit(ch))data=(data<<1)+(data<<3)+(ch^48),ch=getchar();
return data;
}
inline void write(int x){if(x>9)write(x/10);putchar(x%10+'0');}
const int N=1e5+5;
struct node{int x,y,val;}a[N];
inline bool cmpx(const node&a,const node&b){return a.x<b.x;}
inline bool cmpy(const node&a,const node&b){return a.y<b.y;}
int n,p,r,t,sum;
signed main(){
n=rd();
for(int re i=1;i<=n;i++)a[i].x=rd(),a[i].y=rd(),p=rd(),r=rd(),a[i].val=p*r,sum+=a[i].val;
sum=sum+1>>1;
sort(a+1,a+n+1,cmpx);
for(int re i=1;i<=n;i++){t+=a[i].val;if(t>=sum){write(a[i].x),putchar(' ');break;}}
t=0;
sort(a+1,a+n+1,cmpy);
for(int re i=1;i<=n;i++){t+=a[i].val;if(t>=sum){write(a[i].y),putchar(' ');break;}}
exit(0);
}