Cod sursa(job #927466)
| Utilizator | Data | 25 martie 2013 20:18:40 | |
|---|---|---|---|
| Problema | Elementul majoritar | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.43 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream ka("elmaj.in");
ofstream ki("elmaj.out");
unsigned int n,poz,maxim;
unsigned long long a[1000001],x;
int main()
{
ka>>n;
for(unsigned int i=1;i<=n;i++)
{
ka>>x;
a[x]++;
if(a[x]>maxim)
{maxim=a[x];
poz=x;}
}
if(maxim*2>n)
{
ki<<poz<<" "<<maxim;
}
else
ki<<"-1";
}
