Pagini recente » Cod sursa (job #1112979) | Cod sursa (job #1272767) | Cod sursa (job #1553871) | Cod sursa (job #675074) | Cod sursa (job #2284105)
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 1e6;
ifstream fin("elmaj.in");
ofstream fout("elmaj.out");
int v[MAXN + 5];
int main()
{
int n, i, x, cnt = 1;
fin >> n;
for (i = 1; i <= n; ++i)
{
fin >> v[i];
}
sort(v + 1, v + 1 + n);
x = v[n / 2];
for (i = n / 2 - 1; i >= 1; --i)
{
if (v[i] != x)
break;
++cnt;
}
for (i = n / 2 + 1; i <= n; ++i)
{
if (v[i] != x)
break;
++cnt;
}
if (cnt > n / 2)
{
fout << v[n / 2] << ' ' << cnt << '\n';
}
else
fout << "-1\n";
return 0;
}