Cod sursa(job #1907337)
Utilizator | Data | 6 martie 2017 18:53:28 | |
---|---|---|---|
Problema | Elementul majoritar | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Teme Pregatire ACM Unibuc 2013 | Marime | 0.56 kb |
#include <fstream>
#include <algorithm>
using namespace std;
ifstream in("elmaj.in");
ofstream out("elmaj.out");
int main()
{
int n, val =-1 , con=1;
in>>n;
int v[n+1];
for(int i=1;i<=n;i++)
{
in>>v[i];
if(v[i]==val)
con++;
else
con--;
if(con==0)
{
val=v[i];
con=1;
}
}
con=0;
for(int i=1;i<=n;i++)
if(v[i]==val)
con++;
if(con>=n/2+1)
out<<val<<" "<<con;
else
out<<"-1";
}