Pagini recente » Cod sursa (job #9243) | Cod sursa (job #2588152) | Cod sursa (job #2737251) | Cod sursa (job #404603) | Cod sursa (job #1443308)
#include <fstream>
using namespace std;
ifstream f("elmaj.in");
ofstream g("elmaj.out");
int n, i, fact, k, nr;
int a[1000001];
int main()
{
f >> n;
for (i = 1; i <= n; i++)
f >> a[i];
for (i = 1; i <= n; i++)
{
if (!k)
fact = a[i], k = 1;
if (a[i] == fact)
k++;
else
k--;
}
for (i = 1; i <= n; i++)
if (a[i] == k)
nr++;
if (nr >= n/2+1)
g << k << " " << nr;
else
g << -1;
return 0;
}