Pagini recente » Istoria paginii runda/eusebiu_oji_2017_cls11-12 | Cod sursa (job #2797617) | Cod sursa (job #2907445) | Cod sursa (job #1697708) | Cod sursa (job #1326235)
#include <fstream>
#include <vector>
#include <algorithm>
using namespace std;
ifstream in ("elmaj.in");
ofstream out ("elmaj.out");
int main(){
int n,i,x,j;
in>>n;
vector <int> V;
int X=0,ap=0;
for (i=0;i<n;i++)
{in>>x;
V.push_back(x);}
sort(V.begin(),V.end());
i=0;
while (i < n) {
j = i;
while (j < n && V[j + 1]==V[i])
j++;
if (j-i+1>n/2)
X=V[i],ap=j-i+1;
i = j + 1;
}
if (X){
out<<X<<" "<<ap;
}
else out<<-1;
return 0;
}