Submission #72341803

---

Source Code Expand

#include "bits/stdc++.h"
#define f(i, r, op) op ? i <= r : i < r
#define rep(i, l, r, op) for(int i = l; f(i, r, op); i++)
#define inline __inline__
#define change(x, type) static_cast<type>(x)

inline void read(int& x) {
    x = 0; bool f = 0;
    char ch = getchar();
    for (; !isdigit(ch); ch = getchar()) f = ch == '-';
    for (; isdigit(ch); ch = getchar()) x = (x << 3) + (x << 1) + (ch ^ '0');
    x *= f ? -1 : 1;
}

inline void print(int x) {
    if (x < 0) putchar('-'), x = -x;
    if (x > 9) print(x / 10);
    putchar(x % 10 ^ '0');
}

std::pair<int, int> a[35];

int main() {
    std::ios::sync_with_stdio(false);
    std::cin.tie(0); std::cout.tie(0);
    int n; std::cin >> n;
    for (int i = 1; i <= n; i++) {
        int x; std::cin >> x;
        a[i] = {x, i};
    }
    std::sort(a + 1, a + n + 1, [](std::pair<int, int> x, std::pair<int, int> y) {
        return x.first < y.first;
    });
    std::cout << a[1].second << ' ' << a[2].second << ' ' << a[3].second;
}

Submission Info

Judge Result