Pagini recente » Cod sursa (job #1894578) | Cod sursa (job #1367238) | Cod sursa (job #2025357) | Cod sursa (job #981878) | Cod sursa (job #1181778)
/*
Keep It Simple!
*/
#include<fstream>
using namespace std;
int v[1000005];
int N;
int main()
{
ifstream f("elmaj.in");
ofstream g("elmaj.out");
f >> N;
for(int i=1;i<=N;i++) f >> v[i];
int cand = -1, cont = 0;
for(int i=1;i<=N;i++)
if(!cont)
{
cand == v[i];
cont = 1;
}
else if(v[i] == cand) cont++;
else cont--;
int cnt = 0;
for(int i = 1; i<=N;i++)
if(v[i] == cand) cnt++;
if(cnt > N/2)
g << cand << " " << cnt;
else
g << "-1";
}