Cod sursa(job #1590674)
| Utilizator | Data | 5 februarie 2016 13:56:49 | |
|---|---|---|---|
| Problema | Elementul majoritar | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.58 kb |
#include <fstream>
#include <vector>
#include <algorithm>
using namespace std;
ifstream fin ( "elmaj.in" ) ;
ofstream fout ( "elmaj.out" ) ;
vector<int> G ;
int n ;
int main()
{
fin >> n ;
int x ;
for ( int i = 1 ; i <= n ; i++ )
{
fin >> x ;
G.push_back(x) ;
}
sort( G.begin() , G.end() ) ;
int value = G[G.size()/2 -1] ;
int nr = 0 ;
for ( vector<int> :: iterator it = G.begin() ; it != G.end() ; ++it )
if ( *it == value )
nr++ ;
if ( nr > G.size() / 2 )
fout << value << ' ' << nr ;
return 0;
}
