Cod sursa(job #1323969)
Utilizator | Data | 21 ianuarie 2015 17:40:27 | |
---|---|---|---|
Problema | Elementul majoritar | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.43 kb |
#include <fstream>
using namespace std;
ifstream f("elmaj.in");
ofstream g("elmaj.out");
int main()
{
int n,nr;
long v[1000000];
f>>n;
int k;
k=n/2;
for(int i=1;i<=n;i++)
{
nr++;
for(int j=1;j<=n;j++)
if(v[i]==v[j])
nr++;
if(nr>k)
{g<<v[i]<<" "<<nr ;k=-1 ; break;}
}
if(k==-1)
g<<-1;
return 0;
}