-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy path1768C.cpp
45 lines (38 loc) · 842 Bytes
/
1768C.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
/*
RunAt - grey
*/
#include <iostream>
#include <set>
#include <map>
#include <climits>
#include <string>
#include <numeric>
#include <algorithm>
#include <vector>
using namespace std;
typedef int long long ll;
#define p(a) cout << a << "\n";
#define p2(a,b) cout << a << " " << b << "\n";
#define readV(vec) for (auto &e: vec) cin >> e;
#define debugV(vec) for (auto &e: vec) {cout << e << " ";} cout << "\n";
#define YES cout << "YES" << "\n"
#define NO cout << "NO" << "\n"
const int N = 100005;
void solve() {
ll n;
cin >> n;
vector<ll> v(n);
readV(v);
vector<ll> pp(n);
iota(pp.begin(), pp.end(), 0LL);
sort(pp.begin(), pp.end(), [&](int i, int j) {
return v[i] < v[j];
});
debugV(pp);
}
int main() {
int tests = 1;
cin >> tests;
while (tests--) solve();
return 0;
}