Pagini recente » Cod sursa (job #1189582) | Cod sursa (job #2470450) | Cod sursa (job #2193497) | Cod sursa (job #488666) | Cod sursa (job #1784864)
#include <fstream>
#include <vector>
#include <algorithm>
using namespace std;
ifstream cin("elmaj.in");
ofstream cout("elmaj.out");
int n;
vector <int> a;
main()
{
cin >> n;
a.resize(n);
for(int i=0; i<n; i++)
{
cin >> a[i];
}
sort(a.begin(),a.end());
int s,x=a[n/2];
for (int i=0; i<a.size(); i++)
{
if (a[i]==x) s++;
if (a[i]>x) break;
}
if (s>(n/2)) cout << x << ' ' << s ; else cout << -1;
}