Cod sursa(job #2147865)
| Utilizator | Data | 1 martie 2018 08:55:22 | |
|---|---|---|---|
| Problema | Elementul majoritar | Scor | 90 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.56 kb |
#include <cstdio>
#include <map>
using namespace std;
const int nmax=1000000;
map<int,int> ap;
int n,v[nmax+5];
bool gasit=0;
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]);
ap[v[i]]++;
}
for(int i=1;i<=n;i++)
if(ap[v[i]]>=n/2+1)
{
printf("%d %d",v[i],ap[v[i]]);
gasit=1;
break;
}
if(gasit==0)
printf("-1");
return 0;
}
/**
**/
