Pagini recente » Cod sursa (job #2257229) | Cod sursa (job #3262816) | Cod sursa (job #2976716) | Cod sursa (job #3249629) | Cod sursa (job #2590863)
#include <fstream>
#include <iostream>
using namespace std;
ifstream f("elmaj.in");
ofstream g("elmaj.out");
long long v[1000001], c;
int n, i, nr;
int main()
{
f >> n;
for(i = 1; i <= n; ++ i)
{
f >> v[i];
if(!c)
c = v[i];
else if(c == v[i])
nr ++;
else
nr --;
}
for(i = 1, nr = 0; i <= n; ++ i)
if(v[i] == c)
nr ++;
if(nr >= n / 2 + 1)
g << c << " " << nr << "\n";
else
g << "-1\n";
return 0;
}