Pagini recente » Cod sursa (job #2098896) | Cod sursa (job #1670582) | Cod sursa (job #688893) | Cod sursa (job #479582) | Cod sursa (job #2252819)
#include <fstream>
#include <algorithm>
using namespace std;
ifstream f("elmaj.in");
ofstream g("elmaj.out");
int n,mx,v[1000001],nr,p;
int main()
{f>>n;
for(int i=1;i<=n;i++)
{
f>>v[i];
}sort(v+1,v+n+1);
nr=1;
for(int i=2;i<=n;i++)
{
if(v[i]==v[i-1]){nr++;}
else {
if(nr>mx){mx=nr;p=v[i-1];}
nr=1;
}
}if(nr>mx){mx=nr;p=v[n];}
if(mx>=n/2+1)g<<p<<" "<<mx;
else g<< -1;
return 0;
}