Greedy algorithm 1008

The main idea: give a group of numbers, the value of the middle number, than the number of its front, smaller than the number of the back;

Problem Solving Ideas:

Find the array subscript in the middle of the number after sorting

Code:

#include <iostream>#include<algorithm>using namespacestd;BOOLcmpintAintb) {    returna<b;}intMain () {inti,a[10001],n; CIN>>N;  for(i=0; i<n;i++) {cin>>A[i]; } sort (A,a+n,cmp); cout<<a[(n1)/2]<<Endl; return 0;}

Greedy algorithm 1008