Cod sursa(job #1601109)
| Utilizator | Data | 15 februarie 2016 18:55:16 | |
|---|---|---|---|
| Problema | Elementul majoritar | Scor | 30 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.56 kb |
#include <fstream>
using namespace std;
ifstream in("elmaj.in");
ofstream out("elmaj.out");
long int n,v[1000005],u[1000005];
int i,j,c,k=1,k1,r;
int main() {
in>>n;
for(i=1;i<=n;i++)
in>>v[i];
c=v[i];
for(j=1;j<=n;j++)
{
if(c==v[j])k++;
else
{
c=v[j];
k--;
if(k==0) k++;
}
// out<<c<<" "<<k<<'\n';
}
if(k>0) {for(r=1;r<=n;++r){
if(v[r]==c) k1++; }
out<<c<<' '<<k1<<'\n';}
else out<<-1;
return 0;
}
