Pagini recente » Cod sursa (job #2085106) | Cod sursa (job #2903945) | Cod sursa (job #774617) | Cod sursa (job #996779) | Cod sursa (job #1254089)
#include<fstream>
#include<algorithm>
using namespace std;
ifstream f("elmaj.in"); ofstream g("elmaj.out");
int n,i,j,v[1000003];
bool w;
int main()
{ f>>n;
for(i=1;i<=n;i++) f>>v[i];
sort(v+1,v+n+1);
i=1;
while(i<=n and !w)
{ j=i+1;
while(v[j]==v[i]) j++;
if(j-i>n/2) w=true; else i=j;
}
if(w) g<<v[i]<<" "<<j-i<<"\n"; else g<<"-1\n";
g.close(); return 0;
}