fork download
copy 
  1. #include<iostream>
  2. #include<unordered_map>
  3. #include<algorithm>
  4. using namespace std;
  5.  
  6. int highestFrequency(int arr[],int n){
  7. 	unordered_map<int,int>m;
  8. 	for(int i=0;i<n;i++){
  9. 		m[arr[i]] = m[arr[i]] + 1;
  10. 	}
  11. 	int freq = 0;
  12. 	int key;
  13. 	for(auto p:m){
  14. 		if(freq == p.second){
  15. 			auto itr2 = find(arr,arr+n,key);
  16. 			auto itr1 = find(arr,arr+n,p.first);
  17. 			if(itr1<itr2){
  18. 				key = p.first;
  19. 			}
  20. 		}
  21. 		if(freq<p.second){
  22. 			key = p.first;
  23. 			freq = p.second;
  24. 		}
  25. 	}
  26. 	return key;
  27. }
  28. int main() {
  29. 	unordered_map<int,int>m;
  30. 	int n;
  31. 	cin>>n;
  32. 	int arr[n];
  33. 	for(int i=0;i<n;i++){
  34. 		cin>>arr[i];
  35. 	}
  36. 	int ans = highestFrequency(arr,n);
  37. 	cout<<ans;
  38. 	return 0;
  39. }
Success #stdin #stdout 0s 4396KB
comments (?)
stdin
copy 
5
1 2 2 2 3
stdout
copy 
2
https://ideone.com/kgvjPV
language:
C++ (gcc 8.3)
created:
5 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!