Cod sursa(job #1225789)
| Utilizator | Data | 3 septembrie 2014 16:53:59 | |
|---|---|---|---|
| Problema | Elementul majoritar | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.6 kb |
#include <fstream>
using namespace std;
ifstream fin("elmaj.in");
ofstream fout("elmaj.out");
int n,x[1000010],cnt,maj,i;
int main()
{
fin>>n>>x[1];
maj=x[1];
cnt=1;
for(i=2;i<=n;i++)
{
fin>>x[i];
if(!cnt)
{
maj=x[i];
cnt++;
}
else
if(x[i]==maj)
cnt++;
else
cnt--;
}
cnt=0;
for(i=1;i<=n;i++)
if(x[i]==maj)
cnt++;
if(cnt>n-cnt)
fout<<maj<<' '<<cnt;
else
fout<<"-1";
return 0;
}
