Cod sursa(job #1564787)
Utilizator | Data | 9 ianuarie 2016 22:41:14 | |
---|---|---|---|
Problema | Elementul majoritar | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.42 kb |
#include <iostream>
#include <fstream>
using namespace std;
#define MAX 3000000
long long int a[MAX],v[MAX];
int main()
{
unsigned long n,i;
ifstream f("majoritar.in");
ofstream g("majoritar.out");
f>>n;
for(i=1;i<=n;i++)
{
f>>v[i];
a[v[i]]++;
if(a[v[i]]>=(n/2)+1)
{
g<<v[i]<<" "<<a[v[i]];
break;
}
}
return 0;
}