Pagini recente » Cod sursa (job #3195144) | Cod sursa (job #809865) | Cod sursa (job #1562409) | Cod sursa (job #1647361) | Cod sursa (job #2710684)
#include <fstream>
using namespace std;
ifstream cin("elmaj.in");
ofstream cout("elmaj.out");
const int nmx = 1e6 + 5;
int n;
long long v[nmx];
void read(){
cin >> n;
for(int i = 1; i <= n; i++)
cin >> v[i];
}
void solve(){
long long val = -1;
int ap = 0;
for(int i = 1; i <= n; i++)
if(ap == 0){
val = v[i];
ap = 1;
} else if(v[i] == val)
ap++;
else
ap--;
if(val < 0){
cout << -1;
return;
}
ap = 0;
for(int i = 1; i <= n; i++)
if(v[i] == val)
ap++;
if(ap > n / 2){
cout << val << " " << ap;
return;
}
cout << -1;
}
int main()
{
read();
solve();
return 0;
}