Pagini recente » Cod sursa (job #25952) | Cod sursa (job #1666062) | Cod sursa (job #2464381) | Cod sursa (job #1066722) | Cod sursa (job #2254163)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("elmaj.in");
ofstream fout("elmaj.out");
int main()
{
int n;
fin>>n;
int sir[n];
for (int i=1; i<=n; ++i)
fin>>sir[i];
int k=0, sol =-1;
fin.close();
for( int i=1; i<=n; ++i){
if(sir[i]!= sir[i+1]){
k=0;
}
else{
++k;
sol= sir[i];
}
}
k=0;
for( int i=1; i<=n; ++i){
if( sir[i]== sol)
++k;
}
if( k>=n/2+1)
fout<<sol<<" "<<k;
else
fout<<-1;
fout.close();
return 0;
}