Pagini recente » Cod sursa (job #1530734) | Cod sursa (job #1925857) | Cod sursa (job #396530) | Cod sursa (job #1544315) | Cod sursa (job #2862719)
#include <fstream>
#include <vector>
#define M 666013
using namespace std;
ifstream f("elmaj.in");
ofstream g("elmaj.out");
struct hashul
{
int val,frecv;
}sol;
vector <hashul> v[666020];
int n;
void has(int x)
{
int l=x%M;
for(int i=0;i<v[l].size();i++)
if(v[l][i].val==x)
{
v[l][i].frecv++;
if(v[l][i].frecv>=n/2+1)
sol=v[l][i];
return;
}
v[l].push_back({x,1});
}
int i,x;
int main()
{
f>>n;
for(i=1;i<=n;i++)
{
f>>x;
has(x);
}
if(sol.val==0)
g<<-1;
else
g<<sol.val<<" "<<sol.frecv;
return 0;
}