Submission #3719

#	Time	Username	Problem	Language	Result	Execution time	Memory
3719		zzapcoder	Divide into triangle (kriii1_D)	C++98	1 / 1	0 ms	1672 KiB

D

#include<iostream>
#include<vector>
#include<algorithm>
#include<utility>

using namespace std;

#define pox pair<pair<int,int>,int>
#define x first
#define y second

int main(){
	int n; cin >> n;
	vector<pox > vp(3*n, make_pair(make_pair(0,0),0));
	for(int i=0;i<3*n;++i){
		cin>>vp[i].x.x>>vp[i].x.y;
		vp[i].y = i+1;
	}
	sort(vp.begin(), vp.end());
	for(int i=0;i<vp.size();++i){
		cout<<vp[i].y<<' ';
		if(i%3 == 2) cout<<endl;
	}
}

• Subtask 1: 1 / 1