Pagini recente » Cod sursa (job #2580318) | Cod sursa (job #348210) | Cod sursa (job #2593697) | tema | Cod sursa (job #1464240)
#include <fstream>
using namespace std;
///// DESCRIPTION
// THIS PROGRAM FINDS THE MAJORITY
// ELEMENT FROM A VECTOR OF N ELEMENTS
// MAJ EL = APPEARS AT LEAST (N/2) + 1 TIMES
/////
int main(int argc, char **argv)
{
// INPUT
int n;
ifstream indata("elmaj.in");
indata >> n;
indata.close();
int freq[n + 1];
for (int i = 1; i <= n; i++) {
freq[i] = 0;
}
for (int i = 0, aux; i < n; i++) {
indata >> aux;
freq[aux]++;
}
// FIND A MAJORITY ELEMENT AND OUTPUT IT
ofstream outdata("elmaj.out");
for (int i = 1, l = (n / 2) + 1; i <= n; i++) {
if (freq[i] >= l) {
outdata << i << " " << freq[i];
break;
}
}
outdata.close();
return 0;
}