Cod sursa(job #2264102)
Utilizator | Data | 19 octombrie 2018 20:08:04 | |
---|---|---|---|
Problema | Elementul majoritar | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.46 kb |
#include <bits/stdc++.h>
#include <stack>
using namespace std;
int a[1000000],n,c=0;
ifstream f("elmaj.in");
ofstream fout("elmaj.out");
int main()
{
int nr;
f<<n;
for(int i=1;i<=n;i++){
f<<nr;
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)fout<<s.top()<<' '<<c;
else fout<<-1;
return 0;
}