Pagini recente » Cod sursa (job #2659385) | Cod sursa (job #477143) | Cod sursa (job #2090240) | Cod sursa (job #2115873) | Cod sursa (job #1198762)
#include <fstream>
#include <cstdio>
#include <algorithm>
#include <cstring>
#include <cstdlib>
#include <vector>
#include <bitset>
#include <queue>
#include <map>
#include <cmath>
#include <iomanip>
#define pb push_back
#define mp make_pair
using namespace std;
ifstream f("elmaj.in");
ofstream g("elmaj.out");
int N, ap, a[1000005], el=-1;
int main()
{
f>>N;
for (int i=1; i<=N; ++i)
{
f>>a[i];
if (ap==0) el=a[i], ap=1;
else if (a[i]==el) ++ap;
else --ap;
}
if (ap<0) { g<<-1<<'\n'; return 0; }
ap=0;
for (int i=1; i<=N; ++i)
if (a[i]==el) ++ap;
g<<el<<' '<<ap<<'\n';
return 0;
}