# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
3397 | 2013-08-31T05:27:43 Z | pichulia | Divide into triangle (kriii1_D) | C++ | 0 ms | 0 KB |
#include<stdio.h> #include<algorithm> using namespace::std; int n; pair<int,pair<int,int>> a[1305]; int main(){ int i; scanf("%d",&n); for(i=1;i<=3*n;i++){ scanf("%d %d",&a[i].second.first,&a[i].first); a[i].second.second=i; } sort(a+1,a+3*n+1); for(i=1;i<=3*n;i++){ printf("%d ",a[i].second.second); if(i%3==0) printf("\n"); } return 0; }