Submission #72349536

---

Source Code Expand

#include<iostream>
#include<algorithm>
#include<vector>
#include<map>
#define endl '\n'
#define all(x) x.begin(),x.end()
using namespace std;
using ll = long long;
void solve() {
    int n;
    cin >> n;
    vector<pair<int, int>>hr(n);
    for (int i = 0; i < n; i++) {
        cin >> hr[i].first;
        hr[i].second = i + 1;
    }
    sort(all(hr));
    for (int i = 0; i < 3; i++)cout << hr[i].second << " ";
}
int main() {
    cin.tie(nullptr)->ios::sync_with_stdio(false);
    int t = 1;
    //cin >> t;
    while (t--) {
        solve();
    }
    return 0;
}

Submission Info

Judge Result