Cod sursa(job #797306)
Utilizator | Data | 13 octombrie 2012 19:37:21 | |
---|---|---|---|
Problema | Elementul majoritar | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.67 kb |
#include<fstream>
int a[1000002], n;
using namespace std;
int main()
{
ifstream f("elmaj.in");
ofstream g("elmaj.out");
f>>n;
int maj = 0;
int nr = 0;
for(int i = 1; i <= n; i++)
{
f>>a[i];
if(nr == 0)
{
maj = a[i];
nr = 1;
}
else
if(maj == a[i])
nr++;
else
nr--;
}
if(nr == 0)
g << "-1";
else
{
nr = 0;
for(int i = 1; i <= n; i++)
if(maj == a[i])
nr++;
if(nr >= (n+1)/2)
g<< maj << " "<< nr;
else g<<"-1";
}
return 0;
}