Cod sursa(job #703712)
Utilizator | Data | 2 martie 2012 13:54:07 | |
---|---|---|---|
Problema | Elementul majoritar | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.48 kb |
#include <fstream>
#include<algorithm>
using namespace std;
long long n, a[1000000], frecventa[1000000], i;
ifstream f("elmaj.in");
ofstream g("elmaj.out");
inline bool cmp(int i, int j)
{
return i>j;
}
int main()
{
f>>n;
for(i=1;i<=n;i++)
{f>>a[i];
frecventa[a[i]]++;
}
sort(a+1, a+1+n,cmp);
if(frecventa[n/2]>=n/2+1)
g<<a[n/2]<<" "<<frecventa[n/2];
else
g<<-1;
return 0;
}