Submission #3560

#TimeUsernameProblemLanguageResultExecution timeMemory
3560qja0950Divide into triangle (kriii1_D)C++98
1 / 1
0 ms1100 KiB
#include <stdio.h> #include <algorithm> using namespace std; struct A{ int x; int y; int k; }point[999]; bool operator<(A X, A Y) { if(X.y!=Y.y) return X.y<Y.y; return X.x<Y.x; } int main() { int n; scanf("%d", &n); int i, j; for(i=1; i<=3*n; i++) { scanf("%d %d", &point[i].x, &point[i].y); point[i].k=i; } sort(point+1, point+3*n+1); for(i=0; i<n; i++) { for(j=1; j<=3; j++) { printf("%d ", point[i*3+j].k); } printf("\n"); } return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...