Cod sursa(job #1127057)
Utilizator | Data | 27 februarie 2014 10:59:38 | |
---|---|---|---|
Problema | Elementul majoritar | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.42 kb |
# include <fstream>
# include <algorithm>
using namespace std;
ifstream f("elmaj.in");
ofstream g("elmaj.out");
int a[1000005];
int main ()
{
int i,n,VV,x;
f>>n;
for (i=1; i<=n; ++i)
f>>a[i];
nth_element(a+1,a+n/2,a+n+1);
VV=0; x=a[n/2];
for (i=1; i<=n; ++i)
{
if (a[i]==x) ++VV;
}
if (VV>=n/2+1) g<<x<<" "<<VV<<"\n";
else g<<"-1\n";
return 0;
}