3 solutions

  • 0
    @ 2025-7-16 10:30:51
    #include<bits/stdc++.h>
    using namespace std;
    const int N=1000010;
    int a[N],b[N];
    int main()
    {
        int n;
        cin>>n;
        for(int i=1;i<=n;i++)
        {
        	cin>>a[i];
        	b[a[i]]++;//a[i]出现的次数增加一次 
    	}
    	int maxv=1;
    	for(int i=0;i<=1000;i++)
    	{
    		if(b[i]>b[maxv])//b[i]的值就是i出现的次数 
    		{
    			maxv=i;
    		}
    	}
    	cout<<maxv;
    	return 0;
    }

    Information

    ID
    2870
    Time
    1000ms
    Memory
    64MiB
    Difficulty
    3
    Tags
    # Submissions
    20
    Accepted
    9
    Uploaded By