Cod sursa(job #1721141)
| Utilizator | Data | 24 iunie 2016 16:22:43 | |
|---|---|---|---|
| Problema | Elementul majoritar | Scor | 90 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.52 kb |
#include<fstream>
#include<map>
#include<cstdlib>
using namespace std;
ifstream f("elmaj.in");
ofstream g("elmaj.out");
int main()
{
map< int , int > aparitii;
map< int , int >::iterator it;
int i,n,raw;
f>>n;
for(i=0;i<n;++i)
{
f>>raw;
it=aparitii.find(raw);
if(it!=aparitii.end())
++(it->second);
else aparitii.insert(make_pair(raw,1));
}
it=aparitii.begin();
while(it!=aparitii.end())
{
if(it->second>n/2)
{g<<it->first<<' '<<it->second<<'\n';exit(0);}
++it;
}
g<<-1;
}