Pagini recente » Cod sursa (job #1688153) | Istoria paginii runda/dan_barbilian_2011 | Cod sursa (job #774156) | Cod sursa (job #1677238) | Cod sursa (job #2264112)
#include <bits/stdc++.h>
#include <stack>
using namespace std;
int a[1000000],n,c=0;
ifstream f("elmaj.in");
ofstream fout("elmaj.out");
stack<int>s;
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;
}