Cod sursa(job #2302896)
| Utilizator | Data | 15 decembrie 2018 11:23:06 | |
|---|---|---|---|
| Problema | Elementul majoritar | Scor | 30 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.55 kb |
#include <fstream>
using namespace std;
ifstream fin ("elmaj.in");
ofstream fout ("elmaj.out");
int main()
{
int v[1000], n, maj,ap;
fin>>n;
for(int i=1; i<=n; i++)
fin>>v[i];
maj=v[1];
ap=1;
for(int i=2; i<=n; i++)
{
if(maj==v[i])
ap++;
else
ap--;
}
ap=0;
for(int i=1; i<=n; i++)
{
if(maj==v[i])
ap++;
}
if(ap>n/2)
fout<<maj<<" "<<ap;
if(ap<=n/2)
fout<<-1;
return 0;
}
