Cod sursa(job #2040766)
| Utilizator | Data | 16 octombrie 2017 15:26:17 | |
|---|---|---|---|
| Problema | Elementul majoritar | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.56 kb |
#include <fstream>
using namespace std;
int n,x,v[1000005];
ifstream f("elmaj.in");
ofstream g("elmaj.out");
int main()
{
int nr=0,tip=-1;
f>>n;
for(int i=1; i <= n; i++)
{
f>>v[i];
if(nr==0)
{
tip=v[i];
nr++;
}
else if(tip==v[i])
nr++;
else
nr--;
}
int ct=0;
for(int i=1; i<=n ; i++)
if(v[i]==tip)
ct++;
if(ct>=n/2+1)
g<<tip<<" "<<ct;
else g<<-1;
return 0;
}
