ABC306 - C - Centers

0x00 Link

• C - Centers

• Source - AtCoder

• Tag - 芝士水题

• Time - $\ast$

0x01 Source Code

//
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define endl '\n'
#define IOS ios::sync_with_stdio(0), cin.tie(0), cout.tie(0); 

#define data da

const int N = 5e5 + 6;
struct A {
	int data, idx;
	bool operator < (const A& in) const {
		return data == in.data ? idx < in.idx : data < in.data ;
	}
}a[N];
struct B {
	int idx, data;
	bool operator < (const B& in) const {
		return idx == in.idx ? data < in.data : idx < in.idx ;
	}			// ==
}b[N];

void solve() {
	int n;
	cin >> n;
	for (int i = 1; i <= 3 * n; i++) {
		int data;
		cin >> data;
		a[i] = (A){data, i};
	}
	sort(a + 1, a + 3 * n + 1);
	
//	for (int i = 1; i <= 3 * n; i++) cout << a[i].data << " " << a[i].idx << endl;
	
	int idx = 0;
	for (int i = 2; i <= 3 * n; i += 3) b[++idx] = (B){a[i].idx, a[i].data};
	sort(b + 1, b + n + 1);
	
	for (int i = 1; i <= n; i++) {
		cout << b[i].data << " \n"[i == n];
	}
	
//	for (int i = 1; i <= n; i++) cout << b[i].idx << " " << b[i].data << endl;
}

signed main() {
	IOS
	int t = 1;
//	cin >> t;
	while (t--) solve();
	return 0;
}

0x10 Diagram

• 404

0x11 Reference

• 404

---

作者 | 乐意奥AI