Cod sursa(job #1122121)
| Utilizator | Data | 25 februarie 2014 16:23:35 | |
|---|---|---|---|
| Problema | Elementul majoritar | Scor | 30 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.53 kb |
#include <fstream>
#include <algorithm>
using namespace std;
int n, k, i,a,maxi, v[1000010];
bool ok;
ifstream fin("elmaj.in");
ofstream fout("elmaj.out");
int main ()
{
fin >> n ;
maxi = n/2 + 1;
for(i = 1; i <= n; ++i)
{
fin >> a;
++v[a];
if(v[a] >= maxi)
{
maxi = v[a];
ok = 1;
}
}
if(ok)
fout << a << " " << v[a];
else fout << -1;
return 0;
}
