Maximum value in map in c++

auto x = std::max_element(m.begin(), m.end(),
    [](const pair<int, int>& p1, const pair<int, int>& p2) {
        return p1.second < p2.second; });

Source: stackoverflow.com

Maximum value in map in c++

#include <bits/stdc++.h>
using namespace std;

bool compare(const pair<int, int>&a, const pair<int, int>&b)
{
   return a.second<b.second;
}

int main(int argc, char const *argv[])
{
   int n, key, maxn;
   map<int,int> mp;

   cin>>n;

   for (int i=0; i<n; i++)
   {
     cin>>key;
     mp[key]++;
   }

   maxn = max_element(mp.begin(), mp.end(), compare)->second;

   cout<<maxn<<endl;

   return 0;
 }

Source: stackoverflow.com

Similar codes

0 vote142 views1 answer
Waiting in a serial as the spool reflect the queue operation. Demonstrate Printer Behavior in context of Queue.Subject to the Scenario implement the Pop and Push Using C++.
C++
0 vote136 views1 answer
What is c++ file extension
C++
1 vote82 views1 answer
Cheak a number is positive are negative in c ++ in loop
C++
0 vote140 views1 answer
Txt to pdf CPP
C++
2 votes133 views2 answers
What s[i]-'0' does
C++
3 votes141 views2 answers
Print type c++
C++
1 vote131 views1 answer
Priority queue c++ type of pairs
C++
2 votes143 views2 answers
Editable div
C++
23 votes175 views10 answers
Pycharm
C++
0 vote122 views1 answer
C++ throw index out of bound
C++