Cod sursa(job #1337682)
| Utilizator | Data | 9 februarie 2015 12:54:28 | |
|---|---|---|---|
| Problema | Elementul majoritar | Scor | 90 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.58 kb |
#include <iostream>
#include <fstream>
#include <map>
using namespace std;
ifstream in("elmaj.in");
ofstream out("elmaj.out");
int N;
map<int,int>::iterator it;
map<int,int> V;
int main(){
in>>N;
int tmp;
int ElMaj=0;
int Aparitii;
for(int i=1;i<=N;i++)
{
in>>tmp;
it=V.find(tmp);
if(it!=V.end()){
it->second++;
if(it->second>Aparitii){
ElMaj=it->first;
Aparitii=it->second;
}
}
else
V[tmp]=1;
}
out<<ElMaj<<" "<<Aparitii<<"\n";
return 0;
}
