Pagini recente » Cod sursa (job #1183843) | Cod sursa (job #1884158) | Cod sursa (job #2223262) | Cod sursa (job #113789) | Cod sursa (job #1907958)
#include<fstream>
#include<algorithm>
using namespace std;
ifstream f ("elmaj.in");
ofstream g ("elmaj.out");
int st,dr,mij,t,x,i,n,m,a[1000001],s,x1,x2,k,nr;
int main()
{
f>>n;
for(i=1;i<=n;i++) f>>a[i];
x=-1;
k=0;
for(i=1;i<=n;i++){
if(k==0)x=a[i],k=1;
else if(a[i]==x) k++;
else k--;
}
if(x==-1){
g<<-1;
return 0;
}
else {
nr=0;
for(i=1;i<=n;i++)
if(a[i]==x) nr++;
if(nr>=n/2+1) g<<x<<" "<<nr;
else g<<-1;
}
}