Pagini recente » Cod sursa (job #2859351) | Cod sursa (job #296590) | Cod sursa (job #877052) | Cod sursa (job #248010) | Cod sursa (job #1676197)
#include <fstream>
#include <string.h>
#include <vector>
#include <queue>
#include <limits.h>
#define nMax 1000001
#define lgMax 19
#define pb push_back
#define INF INT_MAX
#define bit(i) i&(-i)
using namespace std;
ifstream fin("elmaj.in");
ofstream fout("elmaj.out");
int n;
int v[nMax];
void read()
{
fin>>n;
for(int i=1;i<=n;i++)
fin>>v[i];
}
void solve()
{
int elMaj=-1, cnt=0;
for(int i=1;i<=n;i++)
{
if(elMaj==v[i])
cnt++;
else
{
if(cnt==0)
elMaj=v[i];
else
cnt--;
}
}
cnt=0;
for(int i=1;i<=n;i++)
cnt+=(v[i]==elMaj ? 1 : 0);
if(cnt>n/2)
fout<<elMaj<<" "<<cnt;
else
fout<<-1;
}
int main()
{
read();
solve();
return 0;
}