Cod sursa(job #1338956)
Utilizator | Data | 10 februarie 2015 16:08:41 | |
---|---|---|---|
Problema | Elementul majoritar | Scor | 90 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.44 kb |
#include <iostream>
#include <fstream>
#include <map>
using namespace std;
ifstream f("elmaj.in");
ofstream g("elmaj.out");
map<unsigned long long , unsigned int> fr;
int main()
{
int n, maxi = 0;
long long x, k;
f>>n;
for(int i = 1 ; i <= n ; ++i){
f>>k;
++fr[k];
if(fr[k] > maxi){
maxi = fr[k];
x = k;
}
}
g<<x<<' '<<maxi;
return 0;
}