首页 > 代码库 > poj2388(Who's in the Middle)

poj2388(Who's in the Middle)

 

题目大意:

  给你奇数个奶牛的产奶量,求产奶量的中位数。

 

解题思路。

    sort排序。

 

 

代码:

 1 #include <algorithm> 2 #include <iostream> 3 #include <sstream> 4 #include <cstdlib> 5 #include <cstring> 6 #include <cstdio> 7 #include <string> 8 #include <bitset> 9 #include <vector>10 #include <queue>11 #include <stack>12 #include <cmath>13 #include <list>14 //#include <map>15 #include <set>16 using namespace std;17 /***************************************/18 #define ll long long19 #define int64 __int6420 /***************************************/21 const int INF = 0x7f7f7f7f;22 const double eps = 1e-8;23 const double PIE=acos(-1.0);24 const int d1x[]= {0,-1,0,1};25 const int d1y[]= {-1,0,1,0};26 const int d2x[]= {0,-1,0,1};27 const int d2y[]= {1,0,-1,0};28 const int fx[]= {-1,-1,-1,0,0,1,1,1};29 const int fy[]= {-1,0,1,-1,1,-1,0,1};30 /***************************************/31 void openfile()32 {33     freopen("data.in","rb",stdin);34     freopen("data.out","wb",stdout);35 }36 /**********************华丽丽的分割线,以上为模板部分*****************/37 int a[10005];38 int main()39 {40     int n;41     while(scanf("%d",&n)!=EOF)42     {43         int i,j;44         for(i=0;i<n;i++)45             scanf("%d",&a[i]);46         sort(a,a+n);47         printf("%d\n",a[n/2]);48     }49     return 0;50 }
View Code