UVA 10062 - Tell me the frequencies! Shipu Ahamed - 31 Aug 2020 Problem PDFSolution:/************************************* ******** Team : BUBT_HIDDEN ********** ************************************** *********** Shipu Ahamed ************* *************************************/ #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #define sc scanf #define pf printf #define ll long long #define pi 2*acos(0.0) #define ff first #define se second #define inf (1<<30) //infinity value #define pb push_back #define mod 1000000007 #define ST(v) sort(v.begin(),v.end()) #define cover(a,d) memset(a,d,sizeof(a)) #define input freopen("in.txt","r",stdin) #define output freopen("out.txt","w",stdout) #define maxall(v) *max_element(v.begin(),v.end()) #define minall(v) *min_element(v.begin(),v.end()) #define un(v) ST(v), v.erase(unique(v.begin(),v.end()),v.end()) using namespace std; ll gcd(ll a, ll b) { if (b==0) return a; return gcd(b, a%b); } ll lcm(ll a, ll b) { return a/gcd(a, b)*b; } bool cmp(ll a,ll b) { return a > b; } int main() { // input; // output; string s; int f=0; while(getline(cin,s)) { if(f) pf("\n"); int l=s.size(); mapmp; mapmp1; priority_queuepq; for(int i=0;i:: iterator it; int a=-pq.top(); for(it=mp.end();;it--) { if(a==it->se) { cout<ff<<" "<se<se=0; break; } } pq.pop(); } f=1; } return 0; } https://github.com/Shipu/OnlineJudgeProblemSolutionWithCPlusPlus/tree/master/uva/10062/10062.cpp