Cod sursa(job #1050284)
Utilizator | Alexandru Buicescu PsychoAlex | Data | 8 decembrie 2013 14:25:20 |
---|---|---|---|
Problema | Elementul majoritar | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.58 kb |
#include <iostream>
#include <fstream>
#include <unordered_map>
std::ifstream fin("elmaj.in");
std::ofstream fout("elmaj.out");
int n;
std::unordered_map<int, int> aparitii;
void citire()
{
fin>>n;
int x;
long long maxim = 0, indice;
for(int i = 0; i < n; i++)
{
fin>>x;
aparitii[x]++;
if(aparitii[x] > maxim)
{
maxim = aparitii[x];
indice = x;
}
}
fout<<x<<' '<<maxim<<'\n';
}
void rezolvare()
{
}
int main()
{
citire();
rezolvare();
return 0;
}