廈大oj1438簡單題、map

來源:互聯網
上載者:User
#include<iostream>  #include <map>  #include <string>  #include <fstream>  using namespace std;  int main(){  map<string, int> tongji;  map<string, int>::iterator it;  int shuru1 = 0;  cin>>shuru1;  ifstream ifs("shuju.txt");//  //ifs>>shuru1;//  string shuru2;  int count = 3 * shuru1;  string rank[3];  while(count--){  cin>>shuru2;  //ifs>>shuru2;//  it = tongji.find(shuru2);  if(it == tongji.end()){  tongji[shuru2] = 1;  //tongji.insert(pair<string, int>(shuru2, 1));  }else{  tongji[shuru2]++;  }  }  int max_num;  string max_str;  for(int i = 0; i < 3; i++){  max_num = 0;  for(it = tongji.begin(); it != tongji.end(); it++){  if(it->second > max_num){  max_str = it->first;  max_num = it->second;  }else if(it->second == max_num){  if(it->first < max_str){  max_str = it->first;  }  }  }  if(i == 2){  rank[2] = max_str;  tongji.erase(max_str);  }else if(i == 0){  rank[0] = max_str;  tongji.erase(max_str);  }else if(i == 1){  rank[1] = max_str;  tongji.erase(max_str);  }  }  if(rank[0] > rank[1]){  string temp;  temp = rank[0];  rank[0] = rank[1];  rank[1] = temp;  }  if(rank[0] > rank[2]){  string temp;  temp = rank[0];  rank[0] = rank[2];  rank[2] = temp;  }  if(rank[1] > rank[2]){  string temp;  temp = rank[1];  rank[1] = rank[2];  rank[2] = temp;  }  cout<<rank[0]<<" "<<rank[1]<<" "<<rank[2];  //system("pause");  return 0;  }  

聯繫我們

該頁面正文內容均來源於網絡整理,並不代表阿里雲官方的觀點,該頁面所提到的產品和服務也與阿里云無關,如果該頁面內容對您造成了困擾,歡迎寫郵件給我們,收到郵件我們將在5個工作日內處理。

如果您發現本社區中有涉嫌抄襲的內容,歡迎發送郵件至: info-contact@alibabacloud.com 進行舉報並提供相關證據,工作人員會在 5 個工作天內聯絡您,一經查實,本站將立刻刪除涉嫌侵權內容。

A Free Trial That Lets You Build Big!

Start building with 50+ products and up to 12 months usage for Elastic Compute Service

  • Sales Support

    1 on 1 presale consultation

  • After-Sales Support

    24/7 Technical Support 6 Free Tickets per Quarter Faster Response

  • Alibaba Cloud offers highly flexible support services tailored to meet your exact needs.