Cod sursa(job #1075168)
Utilizator | Data | 8 ianuarie 2014 18:28:52 | |
---|---|---|---|
Problema | Elementul majoritar | Scor | 90 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.46 kb |
#include <fstream>
#include <map>
using namespace std;
typedef map<int, int> mop;
int main() {
ifstream in("elmaj.in");
ofstream out("elmaj.out");
int n, x;
mop v;
in >> n;
while (n--) {
in >> x;
++v[x];
}
mop::iterator i, j;
for (i = j = v.begin(); i != v.end(); ++i)
if (j->second < i->second)
j = i;
out << j->first << " " << j->second;
return 0;
}