#include<vector>
#include<iostream>
#include<algorithm>
#include"partition.h"
using namespace std;
std::vector<int> solve(std::vector<int> A) {
	int n = A.size();
	vector<pair<int, int>>v;
	for (int i = 0; i < n; i++) {
		v.push_back({ A[i],i });
	}
	sort(v.begin(), v.end());
	vector<int>ans;
	for (int i = 0; i < n; i += 2) {
		ans.push_back(v[i].second);
	}
	for (int i = 1; i < n; i += 2) {
		ans.push_back(v[i].second);

	}




	return { ans };
}
