Submission #3735389

---

Source Code Expand

#include<bits/stdc++.h>
using namespace std;
inline int read()
{
    int k=1;int x=0;
    char c=getchar();
    while ((c<'0'||c>'9')&&c!='-')c=getchar();
    if(c=='-')
    k=-1,c=getchar();
    while(c>='0'&&c<='9')
    x=x*10+c-'0',c=getchar();
    return k*x;
}
struct pp{
	int num;
	int data;
}b[100100];
inline int cmp( pp x, pp y)
	{
		return x.data>y.data;
   	}
int a[100100],n,w;
int main()
	{
		n=read(),w=read();
		for(int i=1;i<=n;i++)
			{
				a[i]=read();
				b[a[i]].data++;
				b[a[i]].num=a[i];
			}
		sort(b,b+n+1,cmp);
		int m=b[0].num;
		int k=b[0].data;
		//cout<<"m="<<m;
		if(k>n/2)
			cout<<m<<endl;
		else
			cout<<"?"<<endl;
		return 0;
		
	}

Submission Info

Judge Result