2 条题解

  • 0
    @ 2025-1-17 15:08:29
    #include<bits/stdc++.h>
    #include<map>
    using namespace std;
    
    int main(){
    	freopen("interview.in","r",stdin);
    	freopen("interview.out","w",stdout);
    	int n, t, maxn = 0, le = 0;
    	cin >> n;
    	map<int, int> s;
    	for(int i = 0;i < n;i ++){
    		cin >> t;
    		s[t] ++;
    	}
    	
    	for(auto k:s){
    		if(maxn<k.second){
    			maxn = k.second;
    			le = k.first;
    		}else if(maxn==k.second && le < k.first){
    			le = k.first;
    		}
    	}
    	cout << le << " " << maxn << endl;
    	return 0;
    }
    
    
    # 邝昂然撸撸撸,狗头被大爆
    
    • 0
      @ 2023-8-2 10:03:28
      #include<bits/stdc++.h>
      #include<map>
      using namespace std;
      
      int main(){
      	freopen("interview.in","r",stdin);
      	freopen("interview.out","w",stdout);
      	int n, t, maxn = 0, le = 0;
      	cin >> n;
      	map<int, int> s;
      	for(int i = 0;i < n;i ++){
      		cin >> t;
      		s[t] ++;
      	}
      	
      	for(auto k:s){
      		if(maxn<k.second){
      			maxn = k.second;
      			le = k.first;
      		}else if(maxn==k.second && le < k.first){
      			le = k.first;
      		}
      	}
      	cout << le << " " << maxn << endl;
      	return 0;
      }
      
      • 1

      信息

      ID
      463
      时间
      1000ms
      内存
      256MiB
      难度
      5
      标签
      (无)
      递交数
      84
      已通过
      35
      上传者