Cod sursa(job #1394084)
Utilizator | Data | 19 martie 2015 23:35:11 | |
---|---|---|---|
Problema | Elementul majoritar | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.55 kb |
#include <fstream>
#include <unordered_map>
using namespace std;
ifstream in("elmaj.in");
ofstream out("elmaj.out");
unordered_map <int,int> freq;
int i,n,x,ans,ver,ok;
int main()
{
in>>n;
for(i=1 ; i<=n ; ++i)
{
in>>x;
if( freq.find(x) != freq.end() )
++freq[ x ];
else
{
freq.insert(x);
++freq[ x ];
}
if( freq[ x ] >= n / 2 + 1)
ok = x;
}
if( !ok )
return 0;
out<<ok<<' '<<freq[ ok ];
return 0;
}