Cod sursa(job #2080902)
| Utilizator | Data | 3 decembrie 2017 17:06:27 | |
|---|---|---|---|
| Problema | Elementul majoritar | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.48 kb |
#include <fstream>
using namespace std;
ifstream cin("elmaj.in");
ofstream cout("elmaj.out");
const int mod=1920000;
int ap[mod+5],v[mod+5],n,x;
int main()
{
cin>>n;
for(int i=1;i<=n;i++)
{
cin>>x;
ap[x%mod]++;
v[x%mod]=x;
}
for(int i=0;i<mod;i++)
if(ap[i]>=n/2+1)
{
cout<<v[i]<<" "<<ap[i];
return 0;
}
cout<<-1;
cin.close();
cout.close();
return 0;
}
/**
**/
