Pagini recente » Cod sursa (job #907261) | Cod sursa (job #244596) | Cod sursa (job #2018773) | Cod sursa (job #234714) | Cod sursa (job #2277346)
#include <fstream>
#include <algorithm>
using namespace std;
ifstream fin("elmaj.in");
ofstream fout("elmaj.out");
int n, i, v[1000002];
int main(){
fin>>n;
for(i=1;i<=n;i++)
fin>>v[i];
sort(v+1, v+n+1);
for(i=1;i<=n;i++)
if(v[i] == v[i+n/2]){
fout<<v[i]<<" ";
int s = i;
while(v[s] == v[i])
s--;
s++;
int f = i;
while(v[f] == v[i])
f++;
f--;
fout<<f-s+1;
return 0;
}
fout<<-1;
return 0;
}