Submission #72349793

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<n;i++)
#include <climits>
#define no cout << "No" << endl;
#define yes cout << "Yes" <<endl;
using ll = long long ;
using P=pair<int,int>;
//N×M vector<vector<int>> A(N,vector<int>(M)); A[i][j] A.push_back(data);
//sort (b.begin(),b.end()); if(b.size() >=2);
//int keta = to_string(b).length(); pow(10,keta);
//set<int> a; a.insert(da); a.count(da) for(auto v: a)
//using P=pair<int,int>;vector<P> c;c.emplace_back(da,i) //index保持
//auto dfs =[&](auto f, int i, int j) -> void {};
//b ha kihon zentansaku
//shoujin houhou komentodake nokosite mosha
//set<pair<int,int>> st;st.insert({r,c});st.count({x,y})

int main() {
    int n;
    cin >> n;
    vector<P> pt(n);
    rep(i,n){
        int t;cin >> t;
        pt[i]={t,i+1};
    }

    sort(pt.begin(),pt.end());
    rep(i,3){
        cout << pt[i].second << " " ; 
    }
}

Submission Info

Judge Result