UVA 499 - What's The Frequency, Kenneth?

Problem PDF

Solution:

#include
#include
#include
#include
#include
#include
#include
#include
#include 
#include 
#include
#include
#define ll long long
#define sc scanf
#define pf printf
#define Pi 2*acos(0.0)
using namespace std;
int main()
{
    char s[100000];
    while(gets(s))
    {
        mapmp1;
        mapmp2;
        priority_queuepq;
        for(int i=0;i::iterator it=mp1.begin(); it!=mp1.end(); ++it)
    {
            if(pq.top()== it->second)
            cout<<""<first;
    }
    cout<<" "<
https://github.com/Shipu/OnlineJudgeProblemSolutionWithCPlusPlus/tree/master/uva/499/499.cpp