Cod sursa(job #661656)
| Utilizator | Data | 14 ianuarie 2012 20:43:54 | |
|---|---|---|---|
| Problema | Elementul majoritar | Scor | 90 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.57 kb |
#include<fstream>
using namespace std;
ifstream cin("elmaj.in");
ofstream cout("elmaj.out");
unsigned long long n, a[1000001],b[1000001], majoritar, sol, i;
bool adevarat;
int main()
{
long long 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)
{adevarat=1;
sol=b[i];
majoritar=i;}
if (adevarat) cout<<majoritar<<" "<<sol;
else cout<<"-1";
return 0;
}
