代码：

#include<iostream>
#include<cmath>
#include<algorithm>
using namespace std;
long long n,minx=1919810,cnt;
string ans;
struct city{
	long long student,km;
	string name;
}a[55];
int cmp(city a,city b){
	return a.km<b.km;
}
int main(){
	while(cin>>a[n].student>>a[n].km>>a[n].name)n++;
	sort(a+1,a+n+1,cmp);
	for(int i=0;i<=n;i++){
		cnt=0;
		for(int j=0;j<=n;j++){
			cnt+=abs(a[i].km-a[j].km)*a[j].student;
		}
		if(cnt<=minx){
			minx=cnt;
			ans=a[i].name;
		}
	}
	cout<<ans<<' '<<minx<<endl;
	return 0;
}