map嵌套

 1 #include<iostream>
 2 #include<cstring>
 3 #include<cstdio>
 4 #include<cmath>
 5 #include<algorithm>
 6 #include<map>
 7 #define ll long long
 8 using namespace std;
 9 
10 const int N = 105;
11 
12 map<string, map<string, int>, less<string> > q;
13 
14 int main()
15 {
16     std::ios::sync_with_stdio(false);
17     int T;
18     cin >> T;
19 
20     while (T--)
21     {
22         q.clear();
23         int n, m;
24         char fruit[N], province[N];
25         cin >> n;
26         for (int i = 0; i < n; i++)
27         {
28             cin >> fruit >> province >> m;
29             q[province][fruit] += m;
30         }
31         for (auto it = q.begin(); it != q.end(); it++)
32         {
33             cout << it->first << endl;
34             for (auto itt = (it->second).begin(); itt != (it->second).end(); itt++)
35             {
36                 cout << "   |----" << itt->first << "(" << itt->second << ")" << endl;
37             }
38         }
39         if (T)
40             cout << endl;
41     }
42     return 0;
43 }