Pagini recente » Cod sursa (job #1611244) | Cod sursa (job #2273453) | Cod sursa (job #1619052) | Cod sursa (job #2312069) | Cod sursa (job #1326392)
#include<fstream>
using namespace std;
ifstream fin("elmaj.in");
ofstream fout("elmaj.out");
const int NLIM = 1000005;
int N, V[NLIM];
int candidat, appears, var;
int main()
{
fin >> N;
for(int i = 1; i <= N; i++)
fin >> V[i];
for(int i = 1; i <= N; i++)
{
if(!var)
{
candidat = V[i];
var = 1;
}
else
{
if(V[i] == candidat)
++var;
else
--var;
}
}
for(int i = 1; i <= N; i++)
if(V[i] == candidat)
++appears;
if(appears < N / 2 + 1)
fout << "-1";
else
fout << candidat << " " << appears;
fin.close();
fout.close();
return 0;
}