Cod sursa(job #2389164)
| Utilizator | Data | 26 martie 2019 20:53:24 | |
|---|---|---|---|
| Problema | Elementul majoritar | Scor | 50 |
| Compilator | cpp-64 | Status | done |
| Runda | excelenta-tema3 | Marime | 0.47 kb |
#include <fstream>
#include <map>
using namespace std;
ifstream f("elmaj.in");
ofstream g("elmaj.out");
int n,x,minim;
map <int, int> mymap;
map <int, int> :: iterator it;
int main()
{
f >> n;
minim = (n/2) + 1;
for(int i = 1; i <= n; ++ i)
{
f >> x;
mymap[x]++;
if(mymap[x] >= minim)
{
g << x << ' ' << mymap[x];
return 0;
}
}
f.close(); g.close();
return 0;
}
