Pagini recente » Cod sursa (job #283953) | Cod sursa (job #952308) | Atasamentele paginii Clasament concurs_y | Cod sursa (job #798151) | Cod sursa (job #1001460)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("elmaj.in");
ofstream fout("elmaj.out");
const int nMax = 1000000;
int frec[nMax];
int main()
{
int n, maj;
fin >> n;
maj = n/2 +1;
for(int i=0;i<n;i++){
int nr;
fin >> nr;
frec[nr]++;
}
bool found = false;
for(int i=0; i<n; i++){
if(frec[i] >= maj){
fout << i << ' ' << frec[i] << ' ';
found = true;
}
}
if(!found){
fout << -1 << endl;
}
return 0;
}