Pagini recente » Cod sursa (job #3240074) | Cod sursa (job #3330937) | Cod sursa (job #3344505) | Cod sursa (job #273770) | Cod sursa (job #3342777)
//#include <iostream>
#include <fstream>
#include <algorithm>
using namespace std;
string file = "elmaj";
ifstream cin(file + ".in");
ofstream cout(file + ".out");
const int dim = 1000000;
long long v[dim+1];
int main()
{
long long n, x, i, m=0, am=0, ct=0;
cin >> n;
for (i = 1; i <= n; i++)
{
cin >> v[i];
if (am <= 0) { m = v[i]; am++; }
else if (v[i] == m) am++;
else if (v[i] != m) am--;
}
//verificare
am = 0;
for (i = 1; i <= n; i++)
{
if (v[i] == m) am++;
}
if (am * 2 >= n) cout << m << " " << am;
else cout << -1;
return 0;
}