Pagini recente » Cod sursa (job #1870612) | Cod sursa (job #1212957) | Cod sursa (job #1206901) | Cod sursa (job #1200831) | Cod sursa (job #1061471)
#include <iostream>
#include <fstream>
#include <unordered_map>
using namespace std;
unordered_map<int,int> unmap;
long long maxim,x,n,i,nrmax,v[1000001];
int main()
{
ifstream f("elmaj.in");
ofstream g("elmaj.out");
f>>n;
for(i=0;i<n;i++){
f>>x;
v[i]=x;
unmap[x]++;
if(unmap[x]>=(n/2+1)){
maxim=unmap[x];
nrmax=x;
/* g<<nrmax<<" "<<maxim;
return 0;*/
}
}
for(i=0;i<n;i++)
if(unmap[v[i]]>=(n/2+1))
{
g<<v[i]<<" "<<unmap[v[i]];
return 0;
}
/*if(maxim>0)
g<<nrmax<<" "<<maxim;
else*/
g<<-1;
return 0;
}