Cod sursa(job #1202231)
| Utilizator | Data | 27 iunie 2014 13:02:45 | |
|---|---|---|---|
| Problema | Elementul majoritar | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Teme Pregatire ACM Unibuc 2013 | Marime | 0.55 kb |
#include <fstream>
#include <cstring>
using namespace std;
ifstream cin("elmaj.in");
ofstream cout("elmaj.out");
long long n,i,a,sol1(0),sol2(0);
long long P[200000];
int main()
{
cin>>n;
memset(P,0,sizeof(P));
for (i=1;i<=n;++i){
cin>>a;
++P[a];
if (P[a]>=n/2+1){
sol1=a;
sol2=P[a];
}
}
cout<<sol1<<" "<<sol2;
return 0;
}
