Pagini recente » Cod sursa (job #25525) | Cod sursa (job #2767895) | Cod sursa (job #225765) | Cod sursa (job #2389292) | Cod sursa (job #2374265)
#include <bits/stdc++.h>
using namespace std;
ifstream f("elmaj.in");
ofstream g("elmaj.out");
int n,a;
vector<int> v;
void maj(){
for (int i=0;i<n;i++)
{
f>>a;
v.push_back(a);
}
sort(v.begin(), v.end());
int i=0,rez=0,aux;
while (i < n)
{
aux=v[i];
rez=0;
while (v[i]==aux)
{
rez++;
i++;
}
if (rez>=n/2+1)
{
g<<aux<<" "<<rez;
return;
}
}
g<<-1;
}
int main()
{
f>>n;
maj();
return 0;
}