Cod sursa(job #1338639)
Utilizator | Data | 10 februarie 2015 10:31:05 | |
---|---|---|---|
Problema | Elementul majoritar | Scor | 80 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.46 kb |
#include <iostream>
#include <fstream>
#include <cstring>
#include <string.h>
#include <map>
using namespace std;
ifstream f("elmaj.in");
ofstream g("elmaj.out");
map<long long,int> frec;
int main()
{
int n,i,maxi=0;
long long x,k;
f>>n;
for(i=1;i<=n;i++)
{
f>>k;
frec[k]++;
if(frec[k]>maxi)
{
maxi=frec[k];
x=k;
}
}
g<<x<<' '<<maxi;
return 0;
}