Cod sursa(job #2509612)
Utilizator | Data | 14 decembrie 2019 13:42:13 | |
---|---|---|---|
Problema | Elementul majoritar | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.42 kb |
#include <fstream>
using namespace std;
ifstream in ("elmaj.in");
ofstream out("elmaj.out");
int maj[1000001];
int main()
{
int n, i, x;
in>>n;
for (i=1; i<=n; i++)
{
in>>x;
maj[x]++;
}
for (i=1; i<=n; i++)
if (maj[i]!=0)
if (maj[i]>=(n+1)/2)
{
out<<i<<'\n'<<maj[i];
break;
}
return 0;
}