Pagini recente » Cod sursa (job #2045902) | Cod sursa (job #2404941) | Cod sursa (job #2116448) | Cod sursa (job #2833519) | Cod sursa (job #2658929)
#include <bits/stdc++.h>
using namespace std;
ifstream f("elmaj.in");
ofstream g("elmaj.out");
int n, x[100005];
int main(){
f >> n;
for(int i = 0 ; i < n ; ++ i)
f >> x[i];
int candidat = x[0], contor = 1;
for(int i = 1; i < n ; ++i)
{
if(contor == 0)
candidat = x[i], contor = 1;
if(x[i] == candidat)
contor++;
else
contor--;
}
contor = 0;
for(int i = 0 ; i < n ; ++ i)
if(x[i] == candidat)
contor ++;
if(contor > n/2)
g<<candidat<<" "<<contor;
else
g<<"-1";
return 0;
}