Code getting error

#1

#include<bits/stdc++.h>
using namespace std;
int main()
{
int n;
cin>>n;
int a[n];
map<int,int,greater> mp;
for(int i=0;i<n;i++)
{
cin>> a[i];
mp[a[i]]++;
}
multimap<int,int,greater > mpp;
for(auto it=mp.begin();it!=mp.end();it++)
{
mpp.insert(make_pair(it->second,it->first));
}
for(auto it=mpp.begin();it!=mpp.end();it++)
{
cout<second<<endl;
break;
}
}

#2
#3

but it works on some other compiler

#4

@sunneykumar309,
But your code is working fine on sample test case on CB IDE.

image
image1900×1528 171 KB

#5

@abhijeet.srivastava6499 i am getting TLE for 2 of the test cases .
I used hasing but still i getting TLE.
Is there any more efficient solution does exist?
Please reply fast

#6

@sunneykumar309,
Code Here.
Problems asks for O(n) complexity, so you should use unordered_map.

#7

I hope I’ve cleared your doubt. I ask you to please rate your experience here
Your feedback is very important. It helps us improve our platform and hence provide you
the learning experience you deserve.

On the off chance, you still have some questions or not find the answers satisfactory, you may reopen
the doubt.