Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- #include <vector>
- #include <string>
- #include <iomanip>
- #include <queue>
- #include <cmath>
- #include <algorithm>
- #include <tuple>
- #include <iomanip>
- #include <stdio.h>
- #include <numeric>
- #include <map>
- #define ll long long
- #define i(n) for (int i = 0; i < n; i++)
- #define j(n) for (int j = 0; j < n; j++)
- #define vi vector<int>
- #define vvi vector<vector<int>>
- #define all(a) a.begin(), a.end()
- #define pii pair<int, int>
- #define pb push_back
- using namespace std;
- int main()
- {
- ios_base::sync_with_stdio(0);
- cin.tie(0);
- cout.tie(0);
- int n;
- cin >> n;
- vi a(n);
- i(n) cin >> a[i];
- bool f;
- if (n % 2) {
- f = false;
- } else {
- f = true;
- }
- for (int i = 0; i < n; i++) {
- for (int j = 0; j < n - i - 1; j++) {
- if (f) {
- a[j] = max(a[j], a[j + 1]);
- } else {
- a[j] = min(a[j], a[j + 1]);
- }
- }
- f = !f;
- // j(n) {
- // cout << a[j] << " ";
- // }
- // cout<<"\n";
- }
- cout << a[0];
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement