[FROM WOJ]#2133 紧急召集

传送门

【模板复习】

SOL
中位数是在$(i+1)/2$的位置取得，而带权中位数是在$\sum a[i]>=sum(a[i])/2$的位置取得，与两点距离无关，只与权值相关
证明：设最优位置为$t$
则：${\sum }_{i=1}^{t-1}a[i]\ast dis[i,t]+{\sum }_{i=t+1}^{n}a[i]\ast dis[i,t]>={\sum }_{i=1}^{t}a[i]\ast dis[i,t+1]+{\sum }_{i=t+2}^{n}a[i]\ast dis[i,t+1]$
$$\because dis[t,t]=dis[t+1,t+1]=0$$
$$\therefore \sum _{i=1}^{t}a[i]\ast dis[i,t]+\sum _{i=t+1}^{n}a[i]\ast dis[i,t]>=\sum _{i=1}^{t}a[i]\ast dis[i,t+1]+\sum _{i=t+1}^{n}a[i]\ast dis[i,t+1]$$
$$\therefore \sum _{i=1}^{t}a[i]\ast (dis[i,t]-dis[i,t+1])>=\sum _{i=t+1}^{n}a[i]\ast (dis[i,t+1]-dis[i,t])$$
$$\because dis[i,t]-dis[i,t+1](1<=i<=t)=dis[i,t+1]-dis[i,t](t+1<=i<=n)$$
$$\therefore \sum _{i=1}^{t}a[i]>=\sum _{i=t+1}^{n}a[i]$$
得证

代码：

#include<bits/stdc++.h>
using namespace std;
int num=1,sum,t;
struct node{string c,d;int val;}a[5001];
inline bool cmp(const node&a,const node&b){
	int register l1=a.d.length(),l2=b.d.length();
	if(l1<l2)return 1;
	if(l1>l2)return 0;
	return a.d<b.d;
}
signed main(){
	ios::sync_with_stdio(false);
	while(cin>>a[num].val>>a[num].d>>a[num].c)sum+=a[num].val,num++;num--;
	sort(a+1,a+num+1,cmp);
	for(int register i=1;i<=num;i++){
		t+=a[i].val;
		if(t>=(sum+1)/2)cout<<a[i].c,exit(0);
	}
}