Cod sursa(job #2082338)
| Utilizator | Data | 5 decembrie 2017 23:25:03 | |
|---|---|---|---|
| Problema | Elementul majoritar | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.57 kb |
#include <iostream>
#include <fstream>
#include <climits>
#define DX 1000001
using namespace std;
ifstream inf("elmaj.in");
ofstream outf("elmaj.out");
long long frecv[DX] = {0}, sir[DX];
int main()
{
long long n;
inf >> n;
long long util = n / 2 + 1;
for(long long i = 0; i < n; i++)
{
inf >> sir[i];
frecv[sir[i]]++;
}
for(long long i = 0; i < n; i++)
{
if(frecv[sir[i]] >= util)
{
outf << sir[i] << " " << frecv[sir[i]];
return 0;
}
}
outf << "-1";
return 0;
}