Pagini recente » Cod sursa (job #1814593) | Borderou de evaluare (job #502063) | Cod sursa (job #1111361) | Cod sursa (job #788717) | Cod sursa (job #3243426)
#include <fstream>
#include <algorithm>
using namespace std;
ifstream cin("elmaj.in");
ofstream cout("elmaj.out");
int n, v[1000001], cnt;
int main()
{
cin >> n;
for(int i=1; i<=n; i++)
cin >> v[i];
sort(v+1, v+n+1);
int k = v[n/2];
for(int i=1; i<=n; i++)
if(v[i] == k)
cnt++;
if(cnt >= n/2+1)
cout << k << " " <<cnt;
else
cout << "-1";
return 0;
}