Pagini recente » Cod sursa (job #2616564) | Cod sursa (job #2973263) | Cod sursa (job #420918) | Cod sursa (job #1511769) | Cod sursa (job #2219798)
#include <fstream>
#include <iostream>
#include <string.h>
#include <stdio.h>
using namespace std;
int main()
{
ifstream in("elmaj.in");
ofstream out("elmaj.out");
bool gasit = false;
const long long N= 1000005;
long long v[N], n, aparitii[N], max;
memset(aparitii, 0, sizeof(aparitii));
in >> n;
for (int i = 1; i <= n; i++)
{
in >> v[i];
}
int maj = (n/2)+1;
max = v[1];
for (int i = 1; i <= n; i++)
{
if (v[i] > max)
{
max = v[i];
}
}
for (int i = 1; i <= n; i++)
{
aparitii[i]++;
}
for (int i = 1; i <= n; i++)
{
if (aparitii[i] == maj)
{
out << i << " " << aparitii[i];
gasit = true;
break;
}
}
if (gasit == false)
{
out << "-1";
}
return 0;
}