Cod sursa(job #2394701)
Utilizator | Data | 1 aprilie 2019 20:19:36 | |
---|---|---|---|
Problema | Elementul majoritar | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.5 kb |
#include <fstream>
#include <unordered_map>
using namespace std;
unordered_map<int, int> mymap;
ifstream in ("elmaj.in");
ofstream out ("elmaj.out");
int v[1000006],n;
int main()
{
in>>n;
for (int i=1;i<=n;++i)
{
in>>v[i];
mymap[v[i]]++;
}
for (int i=1;i<=n;++i)
{
if (mymap[v[i]]>n/2)
{
out<<v[i]<<' '<<mymap[v[i]];
return 0;
}
}
out<<-1;
return 0;
}