Pagini recente » Istoria paginii algoritmiada-2022/runda-2 | Istoria paginii template/ctm | Istoria paginii runda/pca/clasament | Istoria paginii algoritmiada-2018/runda-finala/regulament | Cod sursa (job #2439622)
#include <bits/stdc++.h>
using namespace std;
ifstream fin("elmaj.in");
ofstream fout("elmaj.out");
unsigned long n,sanse,maj,nr=0,v[1000001];
int main()
{
fin>>n;
for(int i=1; i<=n; i++){
fin>>v[i];
if(sanse==0){
maj=v[i];
sanse=1;
}
if(v[i]==maj)
sanse++;
else
sanse--;
}
for(int i=1; i<=n; i++)
if(v[i]==maj)
nr++;
if(nr>=n/2+1)
fout<<maj<<" "<<nr;
else
fout<<-1;
return 0;
}