Pagini recente » Cod sursa (job #2646842) | Cod sursa (job #900808) | Cod sursa (job #2225471) | Cod sursa (job #2711444) | Cod sursa (job #2836227)
#include <iostream>
#include <fstream>
#include <unordered_map>
using namespace std;
ifstream fin( "elmaj.in" );
ofstream fout( "elmaj.out" );
unordered_map <int, int> voturi;
int a[1000000];
int main() {
int n, elmaj, nrap, i;
fin >> n;
for( i = 0; i < n; i++ ) {
fin >> a[i];
voturi[a[i]]++;
}
for( i = 0; i < n; i++ ) {
if( voturi[a[i]] > n / 2 ) {
elmaj = a[i];
nrap = voturi[a[i]];
}
}
fout << elmaj << " " << nrap;
return 0;
}