Cod sursa(job #2929023)
Utilizator | Data | 24 octombrie 2022 14:27:12 | |
---|---|---|---|
Problema | Elementul majoritar | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.7 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream in("elmaj.in");
ofstream out("elmaj.out");
int main()
{
int nr,nrap=1,n;
vector<int> v;
in>>n;
for(int i=1;i<=n;i++)
{
int a;
in>>a;
v.push_back(a);
}
map<int, int> m;
for ( int i = 0 ; i < v.size() ; i++ )
{
if ( m.find(v[i]) == m.end() )
{
m.insert(make_pair(v[i], 1));
}
else
{
m[v[i]]++;
}
}
for ( auto it = m.begin() ; it != m.end() ; it++ )
{
if ( (*it).second >= n/2+1 )
{
out<<(*it).first<<" "<<(*it).second;
}
}
return 0;
}