Pagini recente » Cod sursa (job #457452) | Borderou de evaluare (job #3182025) | Cod sursa (job #2976023) | Cod sursa (job #2602631) | Cod sursa (job #810785)
Cod sursa(job #810785)
#include<stdio.h>
#include<algorithm>
using namespace std;
long ap[20000000];
int main()
{
long n,i,a;
freopen("elmaj.in","r",stdin);
freopen("elmaj.out","w",stdout);
scanf("%ld",&n);
for (i=1;i<=n;i++)
{
scanf("%ld",&a);
ap[a]++;
}
for (i=1;i<=20000000;i++)
if (ap[i]>n/2)
{
printf("%ld %ld",i,ap[i]);
break;
}
return 0;
}