Pagini recente » Cod sursa (job #189327) | Cod sursa (job #547137) | Cod sursa (job #2830041) | Cod sursa (job #994187) | Cod sursa (job #1915968)
#include <vector>
#include <algorithm>
#include <fstream>
using namespace std;
ifstream cin ("elmaj.in" );
ofstream cout("elmaj.out");
vector <int> a, x;
int main()
{
int n, y;
cin >> n;
a.resize(n);
for (int i = 0; i < a.size(); cin >> a[i++] );
x.push_back(a[0]);
for (int i = 1; i < a.size(); i++)
{
if (x.size() != 0)
{
if (a[i] == x[x.size() - 1]) x.push_back(a[i]);
else x.pop_back();
}
}
if (x.size() == 0) cout << -1;
else
{
y = count(a.begin(), a.end(), x[0]);
if (y > a.size() / 2) cout << x[0] << ' ' << y;
}
return 0;
}