Cod sursa(job #1394087)
Utilizator | Turturica Razvan DysKode | Data | 19 martie 2015 23:40:25 |
---|---|---|---|
Problema | Elementul majoritar | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.46 kb |
#include <fstream>
#include <tr1/unordered_map>
using namespace std::tr1;
std::ifstream in("elmaj.in");
std::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;
freq[ x ] = freq[ x ] + 1;
if( freq[ x ] >= n / 2 + 1)
ok = x;
}
if( !ok )
return 0;
out<<ok<<' '<<freq[ ok ];
return 0;
}