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