Pagini recente » Cod sursa (job #2175192) | Statistici cont de incercari (Stefan_George) | Cod sursa (job #1706021) | Cod sursa (job #272231) | Cod sursa (job #2263107)
#include <iostream>
#include <fstream>
#include <stack>
using namespace std;
ifstream in("elmaj.in");
ofstream out("elmaj.out");
int n,a[1000001],cont;
stack<int> s;
int main()
{
in>>n;
for(int i=1;i<=n;i++)
{
in>>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())
cont++;
}
if(cont>n/2)
{out<<s.top()<<' '<<cont;}
else out<<-1;
return 0;
}