Cod sursa(job #1322669)
Utilizator | Data | 20 ianuarie 2015 11:39:39 | |
---|---|---|---|
Problema | Elementul majoritar | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.38 kb |
#include <iostream>
#include <fstream>
using namespace std;
int v[1000005],n,i,k,j;
int main()
{
ifstream f("elmaj.in");
ofstream g("elmaj.out");
f>>n;
for (i=1;i<=n;i++)
{
f>>v[i];
k=0;
for (j=1;j<=n;j++)
{
if (v[i]==v[j]) k++;
if (k>=n/2+1) g<<v[i]<<" "<<k;
}
}
return -1;
}