Pagini recente » Cod sursa (job #1619562) | Cod sursa (job #1504119) | Cod sursa (job #2359433) | Cod sursa (job #2055887) | Cod sursa (job #2082334)
#include <iostream>
#include <fstream>
#include <climits>
using namespace std;
ifstream inf("elmaj.in");
ofstream outf("elmaj.out");
long long frecv[1000001] = {0};
int main()
{
long long n, actual, biggest = INT_MIN;
inf >> n;
for(long long i = 1; i <= n; i++)
{
inf >> actual;
frecv[actual]++;
if(biggest < actual) biggest = actual;
}
n /= 2;
n += 1;
for(long long i = 1; i <= actual; i++)
{
if(frecv[i] >= n)
{
outf << i << " " << frecv[i];
return 0;
}
}
outf << "-1";
return 0;
}