【HDU1263 水果】 STL之map应用经典好题

#include <iostream>
#include <cstdio>
#include <cstring>
#include <map>
#include <algorithm>
using namespace std;

int main()
{
int T, m;
cin >> T;
while(T--)
{
map<string,map<string,int> >mp;   ///注意格式
string place, name;
int num;
cin >> m;
for(int i=0; i<m; i++)
{
cin >> name >> place >> num;
mp[place][name]+=num;;
}
for(map<string,map<string,int> >::iterator iter1=mp.begin(); iter1!=mp.end(); iter1++) ///第一关键字（map里居然会自动排序，难道和hash表一样的？真心感觉自己肤浅）
{
cout << iter1->first <<endl;
for(map<string,int >::iterator iter2=iter1->second.begin(); iter2!=iter1->second.end(); iter2++)  ///第二关键字
cout << "   |----" << iter2->first << "(" << iter2->second << ")" <<endl;
}
if(T) cout << endl;
}
return 0;
}