Cod sursa(job #2264119)
Utilizator | Data | 19 octombrie 2018 20:16:32 | |
---|---|---|---|
Problema | Elementul majoritar | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.54 kb |
#include <iostream>
#include <fstream>
#include <stack>
using namespace std;
ifstream citeste("elmaj.in");
ofstream afiseaza("elmaj.out");
int n,a[1000001],c=0;
stack<int> s;
int main()
{
citeste>>n;
for(int i=1;i<=n;i++)
{
citeste>>a[i];
if(s.size()==0||s.top()==a[i])s.push(a[i]);
else if(s.top()!=a[i])s.pop();
}
for(int i=1;i<=n;i++)
{
if(a[i]==s.top())
c++;
}
if(c>n/2)
{afiseaza<<s.top()<<' '<<c;}
else afiseaza<<-1;
return 0;
}