uva 484 - The Department of Redundancy Department

已有的数据结构装不下数据，或者不能处理现有的数据，那就必须要思考其他的辅助手段，辅助结构；

 #include <cstdio>
 #include <map>
 #include <vector>
 using namespace std;

 vector<int> order;
 map<int, int> freq;

 int main()
 {
     int n;
     freq.clear();
     while(scanf("%d", &n) != EOF)
     {
         if(freq.count(n)) freq[n] ++;
         else freq[n] = , order.push_back(n);
     }
     for(auto it = order.begin(); it != order.end(); ++ it)
              printf("%d %d\n", *it, freq[*it]);

     /*for(int i = 0; i < (int)order.size(); i++)
         printf("%d %d\n", order[i], freq[order[i]]);*/
     return ;
 }