Cod sursa(job #1691486)
| Utilizator | Data | 18 aprilie 2016 15:33:36 | |
|---|---|---|---|
| Problema | Elementul majoritar | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Teme Pregatire ACM Unibuc 2013 | Marime | 0.73 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("elmaj.in");
ofstream out("elmaj.out");
int v[1000001];
int main()
{
int n,c,cnt;
in>>n>>v[1];
cnt=1;
c=v[1];
for(int i=2;i<=n;i++)
{
in>>v[i];
if(v[i]==c)
cnt++;
else
cnt--;
if(cnt<0)
{
cnt=1;
c=v[i];
}
}
if(cnt<0)
{
out<<"-1";
return 0;
}
else
{
cnt=0;
for(int i=1;i<=n;i++)
{
if(v[i]==c)
cnt++;
}
if(cnt>=n/2)
out<<c<<" "<<cnt;
return 0;
}
out<<"-1";
return 0;
}
