Cod sursa(job #2289716)
| Utilizator | Data | 25 noiembrie 2018 08:38:46 | |
|---|---|---|---|
| Problema | Elementul majoritar | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.59 kb |
#include <fstream>
using namespace std;
int V[1000009],i,n,win,cnt;
ifstream f("elmaj.in");
ofstream g("elmaj.out");
int main()
{
f>>n>>V[1];
cnt=1;
win=V[1];
for(i=2;i<=n;i++)
{
f>>V[i];
if(cnt==0){
win=V[i];
cnt=1;
}
else
{
if(V[i]!=win) cnt--;
else cnt++;
}
}
cnt =0;
for(i=1;i<=n;i++)
if(V[i]==win)
cnt++;
if(cnt>=(n/2)+1)
g<<win<<" "<<cnt;
else
g<<-1;
f.close();
g.close();
return 0;
}
