Pagini recente » Cod sursa (job #2745894) | Cod sursa (job #1456426) | Cod sursa (job #2563574) | Cod sursa (job #591567) | Cod sursa (job #2084895)
#include <map>
#include <fstream>
using namespace std;
ifstream fin("elmaj.in");
ofstream fout("elmaj.out");
int main(){
map<long int, long int> vec;
long int n, element, max = 0, key;
fin >> n;
for(long int i = 0; i < n; i++){
fin >> element;
vec[element]++;
}
for(map<long int, long int>::iterator it = vec.begin(); it != vec.end(); it ++)
if(max < it->second){
key = it->first;
max = it->second;
}
if(vec[key] >= n / 2 + 1)fout << key << " " << vec[key];
else fout << "-1";
fin.close();
fout.close();
return 0;
}