Cod sursa(job #897479)
Utilizator | Rares Cheseli rares96cheseli | Data | 27 februarie 2013 20:54:57 |
---|---|---|---|
Problema | Elementul majoritar | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.41 kb |
#include<iostream>
#include<fstream>
using namespace std;
ifstream f("elmaj.in");
ofstream g("elmaj.out");
int n,a[1000010],x,maxi=0,maxix;
int main() {
f>>n;
for(int i=1; i <=n; ++i)
{
f>>x;
a[x]++;
if(a[x]>maxi)
{
maxi=a[x];
maxix=x;
}
}
g<<maxix << ' ' <<maxi;
f.close(); g.close();
return 0;
}