Pagini recente » Cod sursa (job #1515703) | Cod sursa (job #2097840) | Cod sursa (job #77958) | Cod sursa (job #967758) | Cod sursa (job #2540923)
#include <bits/stdc++.h>
std::ifstream fin("elmaj.in");
std::ofstream fout("elmaj.out");
int n, cnt=1, ret, nr;
int list[1000000];
int main()
{
fin>>n;
for(int i=1; i<=n; ++i) fin>>list[i];
std::sort(list+1, list+n+1);
for(int i=2; i<=n+1; ++i){
if(list[i]!=list[i-1]){
if(cnt>n/2){
fout<<list[i-1]<<" "<<cnt;
return 0;
}
cnt=1;
}
else ++cnt;
}
fout<<-1;
return 0;
}