Cod sursa(job #1707444)
| Utilizator | Data | 25 mai 2016 08:21:58 | |
|---|---|---|---|
| Problema | Elementul majoritar | Scor | 50 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.3 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin("elmaj.in");ofstream fout("elmaj.out");
unordered_map<int,int>aparitii;int x,n;
int main()
{
fin>>n;
for(int copn=n;copn;--copn){fin>>x;aparitii[x]++;if(aparitii[x]>=(n/2+1)){fout<<x<<' '<<aparitii[x];break;}}
return 0;
}
