HDU 1029【模拟】

willem248

于 2022-08-21 09:40:25 发布

阅读量74

点赞数

分类专栏： HDU 文章标签： c++ 算法蓝桥杯

转载请注明出处，谢谢。

本文链接：https://blog.csdn.net/lxylluvio/article/details/126447654

版权

HDU 专栏收录该内容

5 篇文章 0 订阅

订阅专栏

#include <iostream>
#include <cstdio>
#include <cstring>
#include <string>
#include <cctype>
#include <cstdlib>
#include <cmath>
#include <algorithm>
#include <stack>
#include <queue>
#include <deque>
#include <list>
#include <tuple>

using namespace std;

int read() {
  int opt, x;
  opt = 1;
  char ch;
  while (!isdigit(ch = getchar()))
    if (ch == '-')
      opt = -1;
  x = ch ^ '0';
  while (isdigit(ch = getchar()))
    x = (x << 3) + (x << 1) + (ch ^ '0');
  return x * opt;
}

const int N = 1e6 + 10;
int a[N];

#if __cplusplus >= 201703L
constexpr inline int min(int l, int r) noexcept {
  return l < r ? l : r;
}

constexpr inline int max(int l, int r) noexcept {
  return l > r ? l : r;
}

constexpr inline void swap(int a, int b) noexcept {
  a ^= b ^= a ^= b;
}
#endif

signed main() {
  int n;
  while (scanf ("%d", &n) == 1) {
    for (int i = 1; i <= n; i ++)
      scanf ("%d", &a[i]);
    sort (a + 1, a + n + 1);
    int mid = (1 + n) / 2;
    printf ("%d\n", a[mid]);
  }
  return 0;
}