Cod sursa(job #1523758)
| Utilizator | Data | 13 noiembrie 2015 10:15:30 | |
|---|---|---|---|
| Problema | Elementul majoritar | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.72 kb |
#include <iostream>
#include <fstream>
#include <unordered_map>
#define NMAX 1000005
using namespace std;
int x,n,Max,el,cand,k;
ifstream in("elmaj.in");
ofstream out("elmaj.out");
int a[NMAX];
int main()
{
in >> n;
for(int i=0;i<n;i++)
{
in >> a[i];
}
for(int i=0;i<n;i++)
{
if(k==0)
{
cand = a[i];
k=1;
}
else if(cand==a[i])
{
k++;
}
else
k--;
}
int nr=0;
for(int i=0;i<n;i++)
{
if(a[i]==cand)
{
nr++;
}
}
if(nr>n/2) out << cand << " " << nr ;
else out << -1;
return 0;
}
