Cod sursa(job #1807797)
Utilizator | Data | 16 noiembrie 2016 22:09:24 | |
---|---|---|---|
Problema | Elementul majoritar | Scor | 20 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.48 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("elmaj.in");
ofstream g("elmaj.out");
int i,j,n,max1=-13;
long *v,el;
long *v1;
int main()
{
f>>n;
v=new long[n+5];
v1=new long[2*(10^9)];
for(i=1;i<=n;i++)
{
f>>v[i];
if(v1[v[i]]>1000000)
v1[v[i]]=0;
v1[v[i]]++;
if(max1<v1[v[i]])
{
max1=v1[v[i]];
el=v[i];
}
}
g<<el<<" "<<max1;
}