Pagini recente » Cod sursa (job #354110) | Cod sursa (job #2454182) | Cod sursa (job #3279680) | Cod sursa (job #2142923) | Cod sursa (job #1101213)
#include <fstream>
#include <vector>
using namespace std;
ifstream is ("elmaj.in");
ofstream os ("elmaj.out");
int n, x;
int ap[1000000];
vector <int> v;
void Solve();
int main()
{
Solve();
is.close();
os.close();
return 0;
}
void Solve()
{
is >> n;
for (int i = 0; i < n; ++i)
{
is >> x;
v.push_back(x);
ap[v[i]]++;
}
for (int i = 0; i < n; ++i)
if (ap[v[i]] >= (n/2)+1)
{
os << v[i] << ' ' << ap[v[i]];
return;
}
os << -1;
};