Pagini recente » Cod sursa (job #626610) | Cod sursa (job #3167944) | Cod sursa (job #2800731) | Cod sursa (job #1937627) | Cod sursa (job #948397)
Cod sursa(job #948397)
#include<fstream>
#include<map>
using namespace std ;
ifstream fin("elmaj.in");
ofstream fout("elmaj.out");
map<int, int> my_map ;
int n ;
bool ok = false ;
int maxim, nrap ;
int main()
{
fin >> n ;
int x ;
for(int i = 1; i <= n; ++i )
{
fin >> x ;
map<int, int> :: iterator it = my_map.find(x) ;
if( it != my_map.end() )
{
int nr = it -> second ;
++nr ;
my_map.erase(it -> first) ;
my_map.insert( make_pair (x, nr));
if( nr >= n / 2 + 1 )
{
maxim = x ;
ok = true ;
}
if( x == maxim )
nrap = nr ;
}
else
my_map.insert( make_pair (x, 1));
}
if( ok == false )
fout << "-1" ;
else
fout << maxim << " " << nrap ;
return 0 ;
}