fork download
copy 
  1. #include <bits/stdc++.h>
  2. using namespace std;
  3.  
  4. int main() {
  5. 	int n ; 
  6. 	cin>>n; 
  7. 	unordered_map<int , int> k ; 
  8. 	for(int i =0 ; i<n; i++){
  9. 		int y ; 
  10. 		cin>>y; 
  11. 		k[y]= k[y]+1; 
  12.  
  13. 	}
  14. 	int minfreq = INT_MAX; 
  15. 	int maxfreq=0 ; 
  16. 	int minelem=-1; 
  17. 	int maxelem= -1 ; 
  18.  
  19. 	for(auto itr= k.begin();itr !=k.end();++itr){
  20. 		int count = itr->second; 
  21. 		int number= itr-> first; 
  22. 		if (count< minfreq){
  23. 			minfreq= count; 
  24. 			minelem= number; 
  25.  
  26. 		}
  27.  
  28. 		if (count> maxfreq){
  29. 			maxfreq= count; 
  30. 			maxelem= number; 
  31. 		}
  32. 	}
  33. 	cout<< maxelem <<"-->"<< maxfreq<<" "; 
  34. 	cout<< minelem <<"-->" << minfreq<<" ";
  35. 	// your code goes here
  36. 	return 0;
  37. }
Success #stdin #stdout 0s 5324KB
comments (?)
stdin
copy 
5
1 1 2 2 3
stdout
copy 
1-->2 3-->1
https://ideone.com/MEKWil
language:
C++14 (gcc 8.3)
created:
8 hours ago
visibility:
public

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!