Pagini recente » Cod sursa (job #698371) | Cod sursa (job #2483220) | lasm_22.05.2017cl11 | Cod sursa (job #935728) | Cod sursa (job #1514701)
#include <iostream>
#include <fstream>
using namespace std;
int main()
{
ifstream in("elmaj.in");
ofstream out("elmaj.out");
long long n,v[1000001],x,i,k;
in>>n;
for(i=1; i<=n; i++)
in>>v[i];
x=v[1];
k=1;
for(i=2; i<=n; i++)
if(x==v[i])
k++;
else
if(k>0)
k--;
else
{
x=v[i];
k=1;
}
k=0;
for(i=1; i<=n; i++)
if(x==v[i])
k++;
if(k>n/2)
out<<x<<" "<<k;
else
out<<"-1";
in.close();
out.close();
return 0;
}