hdoj-1004-Let the Balloon Rise(map排序)

map按照value排序

#include <iostream> 
#include <algorithm>
#include <cstring>
#include <map>
#include <vector>
#include <utility>
using namespace std;
typedef pair<string, int> PAIR;
bool cmp_by_value(const PAIR& lhs, const PAIR& rhs) {
    return lhs.second > rhs.second;
}
map<string ,int> ship;
int main() {
    int n;
    while (cin>>n, n) {
        ship.clear();
        for (int i=0; i<n; i++) {
            string tmp;
            cin>>tmp;
            ship[tmp]++;
        }
        vector<PAIR> vec(ship.begin(), ship.end());
        sort(vec.begin(), vec.end(), cmp_by_value);
        cout<<vec.begin()->first<<endl;
    }
    return 0;
}