lanqiao OJ1531 快递分拣

//vector+map
#include<bits/stdc++.h>
using namespace std;

int main()
{
	map<string,vector<string>> kd;
	vector<string> citys;
	int n;cin>>n;
	for(int i=1;i<=n;i++){
		string x;cin>>x;//快递单号
		string y;cin>>y;//城市
		if(!kd.count(y)) citys.push_back(y);
		kd[y].push_back(x);
	}
	for(auto &i : citys){
		cout<<i<<' '<<kd[i].size()<<endl;
		for(auto &j:kd[i]) cout<<j<<endl;
	}
	return 0;
}