Pagini recente » Cod sursa (job #2205696) | Cod sursa (job #2874505) | Borderou de evaluare (job #618304) | Cod sursa (job #1886778) | Cod sursa (job #795062)
Cod sursa(job #795062)
#include <stdio.h>
#include <map>
using namespace std;
map<int,int> m;
int a[1000005];
int main(){
int x,n;
freopen("elmaj.in","r",stdin);
freopen("elmaj.out","w",stdout);
scanf("%d",&n);
for(int i=0;i<n;i++){
scanf("%d",&x);
m[x]++;
a[i]=x;
}
bool ok=false;
for(int i =0;i<n;i++)
if(m[a[i]]>=(n/2+1))
{ printf("%d %d",a[i],m[a[i]]);
ok=true;break;
}
if(!ok)
printf("-1");
return 0;
//(*(m.end()-1));
}