Cod sursa(job #2929520)
Utilizator | Data | 25 octombrie 2022 23:39:08 | |
---|---|---|---|
Problema | Elementul majoritar | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.42 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin("elmaj.in");
ofstream fout("elmaj.out");
const int NMAX = 1e6+5;
int n, arr[NMAX];
map<int, int>m;
int main()
{
fin >> n;
for(int i=1;i<=n;++i)
fin >> arr[i], m[arr[i]]++;
for(int i=1;i<=n;++i)
{
if(m[arr[i]] >= n/2+1)
{
fout << arr[i] << ' ' << m[arr[i]];
break;
}
}
}