Pagini recente » Cod sursa (job #508537) | Cod sursa (job #52973) | Cod sursa (job #2701260) | Cod sursa (job #3228442) | Cod sursa (job #1405241)
#include <fstream>
#include <vector>
using namespace std;
ifstream is("elmaj.in");
ofstream os("elmaj.out");
int n;
int a[200010];
int nr = -1;
int k = 0;
void Solve();
int main()
{
is >> n;
for(int i = 1; i <= n; ++i)
is >> a[i];
Solve();
is.close();
os.close();
return 0;
}
void Solve()
{
nr = a[1];
k = 1;
for(int i = 2; i <= n; ++i)
{
if( k == 0)
{
nr = a[i];
k = 1;
continue;
}
if(a[i] == nr)
k++;
else
k--;
}
int cnt = 0;
for(int i = 1; i <= n; ++i)
{
if(a[i] == nr)
cnt++;
}
if(cnt >= (n/2))
os << nr << ' ' << cnt;
else
os << "-1";
return;
}