Cod sursa(job #1083855)
Utilizator | Data | 16 ianuarie 2014 15:02:49 | |
---|---|---|---|
Problema | Elementul majoritar | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Teme Pregatire ACM Unibuc 2013 | Marime | 0.4 kb |
#include<stdio.h>
#include<algorithm>
using namespace std;
int n,v[1000005],c=0,el;
int main()
{
freopen("elmaj.in","r",stdin);
freopen("elmaj.out","w",stdout);
scanf("%d",&n);
for(int i=1;i<=n;++i)scanf("%d",&v[i]);
nth_element(v+1,v+n/2,v+n);
el=v[n/2];
for(int i=1;i<=n;++i)if(v[i]==el)c++;
if(c<=n/2)printf("-1\n");
else printf("%d %d\n",el,c);
}