Cod sursa(job #663145)
Utilizator | Data | 17 ianuarie 2012 21:53:43 | |
---|---|---|---|
Problema | Elementul majoritar | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.47 kb |
#include <fstream>
using namespace std;
ifstream f("elmaj.in");
ofstream g("elmaj.out");
long a[5000000];
int main()
{
long long i,n,p,max,x;
f>>n;
max=0;p=-1;
for(i=1;i<=n;i++)
{
f>>x;
if (x>max)
max=x,a[x]++;
}
for(i=1;i<=max;i++)
if (a[i]>=n/2+1)
p=i;
if (i==-1)
g<<"-1\n";
else
g<<p<<" "<<a[p]<<"\n";
return 0;
}