Pagini recente » Cod sursa (job #1818781) | Cod sursa (job #2930412) | Cod sursa (job #950734) | Cod sursa (job #3208099) | Cod sursa (job #1071873)
#include <fstream>
using namespace std;
ifstream fin("elmaj.in");
ofstream fout("elmaj.out");
int v[1000001] , N;
void solve()
{
int k = 0 , cand = -1 , nr = 0;
for(int i = 0;i<N;++i)
if(!k)
cand = v[i] , k = 1;
else
k += ( v[i] == cand ? 1 : -1);
for(int i = 0;i<N;++i)
nr+= v[i] == cand;
if(nr > N/2)
fout<<cand<<" "<<nr<<'\n';
else
fout<<-1<<'\n';
}
int main()
{
fin>>N;
for(int i = 0;i<N;++i)
fin>>v[i];
solve();
return 0;
}