Leetcode-911 Online Election(在线选举)

class TopVotedCandidate
{
    public:
        vector<pair<int,int>> List;
        TopVotedCandidate(vector<int> persons, vector<int> times)
        {
            map<int,int> m;
            int max_count = 0;
            int man = 0;
            for(int i = 0 ; i < times.size(); i ++)
            {
                auto tmp = m.find(persons[i]);
                if(tmp != m.end())
                {
                    m[persons[i]] ++;
                }
                else
                {
                    m[persons[i]] = 1;
                }
                if(m[persons[i]] >= max_count)
                {
                    max_count = m[persons[i]];
                    man = persons[i];
                }

                List.push_back(make_pair(times[i],man));
            }
        }

        int q(int t)
        {
            for(int i = 0; i < List.size()-1; i ++)
            {
                if(t >= List[i].first && t < List[i+1].first)
                    return List[i].second;
            }
            return List[List.size()-1].second;
        }
};