fork(1) download
copy 
  1. #include<iostream>
  2. #include<map>
  3. #include<set>
  4. #include<algorithm>
  5. #include<vector>
  6. #include<stdio.h> 
  7. #define GI ({int t;scanf("%d",&t);t;})
  8. //int a[100009];
  9. using namespace std;
  10. int main()
  11. {
  12.         int trial;
  13.         cin >> trial;
  14.         while (trial--) 
  15.         {
  16.         int n;
  17.         cin >> n;
  18.         map<int, int> mp;
  19.        for(int i=0;i<n;i++)
  20.         {
  21.         int val;
  22.         cin >> val;
  23.         mp[val]++;
  24.         }
  25.  
  26.         int maxi;
  27.         int index = -1;
  28.         int val = 0;
  29.         for (map<int, int>::iterator it = mp.begin(); it != mp.end(); it++) 
  30.         {
  31.         if (val == 0) 
  32.         {
  33.         maxi = (it)->second;
  34.         index = (it)->first;
  35.         val = 1;
  36.         }
  37.          else 
  38.          {
  39.         int p = (*it).second;
  40.         if (p > maxi)
  41.            {
  42.             maxi = p;
  43.            index = (*it).first;
  44.           }
  45.         }
  46.         }
  47.         cout << index << " " << maxi << endl;
  48.         }
  49.  
  50. return 0;
  51. }
Success #stdin #stdout 0s 3480KB
comments (?)
stdin
copy 
3
5
1 2 3 2 5
6
1 2 2 1 1 2
5
-2 3 -5 -2 -2
stdout
copy 
2 2
1 3
-2 3
https://ideone.com/qO9SOZ
language:
C++14 (gcc 8.3)
created:
9 years ago
visibility:
secret

Share or Embed source code

Discover > Sphere Engine API

The brand new service which powers Ideone!

Discover > IDE Widget

Widget for compiling and running the source code in a web browser!