Cod sursa(job #661648)
Utilizator | Data | 14 ianuarie 2012 20:38:02 | |
---|---|---|---|
Problema | Elementul majoritar | Scor | 60 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.47 kb |
#include<fstream>
using namespace std;
ifstream cin("elmaj.in");
ofstream cout("elmaj.out");
int n, a[100005],b[100005], majoritar, sol, i;
int main()
{
int max=0;
cin>>n;
for(i=1;i<=n;i++)
{ cin>>a[i];
b[a[i]]++;
if(a[i]>max)
max=a[i];
}
majoritar=n/2+1;
for(i=1;i<=max;i++)
if(b[i]>=majoritar)
{sol=b[i];
majoritar=i;}
cout<<majoritar<<" "<<sol;
return 0;
}