本文主要是介绍HDU1263-map，希望对大家解决编程问题提供一定的参考价值，需要的开发者们随着小编来一起学习吧！
题目：题目链接
题意：题目的意思就是按照又产地到水果的次序，统计每一个产地不同水果的销售情况。用map的映射很强大，二维的
map使用：
#include <iostream>
#include <cstdio>
#include <string>
#include <string.h>
#include <map>
#include <vector>
#include <cstdlib>
#include <algorithm>
#include <cmath>
#include <queue>
#include <set>
#include <stack>
#include <functional>
#include <fstream>
#include <sstream>
#include <iomanip>
#include <numeric>
#include <cassert>
#include <bitset>
#include <stack>
#include <ctime>
#include <list>
#define INF 0x7fffffff
#define max3(a,b,c) (max(a,b)>c?max(a,b):c)
#define min3(a,b,c) (min(a,b)<c?min(a,b):c)
#define mem(a,b) memset(a,b,sizeof(a))
using namespace std;
int t, n;
int main()
{scanf("%d", &t);while(t--){scanf("%d", &n);map<string, map<string, int> >mp;string place, name;int num;for(int i = 0; i < n; ++i){cin >> name >> place >> num;mp[place][name] += num;}for(map<string, map<string, int> >::iterator iter1 = mp.begin(); iter1!= mp.end(); iter1++){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;
}
这篇关于HDU1263-map的文章就介绍到这儿，希望我们推荐的文章对编程师们有所帮助！
