Pagini recente » Cod sursa (job #1192879) | Cod sursa (job #3245896) | Cod sursa (job #2532370) | Cod sursa (job #1026720) | Cod sursa (job #1547677)
#include <iostream>
#include <fstream>
#include <algorithm>
using namespace std;
ifstream fin("elmaj.in");
ofstream fout("elmaj.out");
#define MAX 1000100
int a[MAX];
int main()
{
int el, s = 0, n, i;
fin >> n;
for(i = 1 ; i <= n ; i++)
{
fin >> a[i];
}
nth_element(a + 1, a + (n + 1) / 2 + 1, a + n + 1);
el = a[(n + 1) / 2];
for(i = 1 ; i <= n ; i++)
{
if(a[i] == el)
s++;
}
if(s > n / 2)
fout << el << " " << s << "\n";
else
fout << "-1\n";
}