Submission #3844

#TimeUsernameProblemLanguageResultExecution timeMemory
3844shinhj88Divide into triangle (kriii1_D)C++98
0 / 1
0 ms1092 KiB
#include<stdio.h> #include<stdlib.h> typedef struct{ int x, y, idx; }Str; Str str[900]; int n; int cmp(const void * a, const void * b){ if(*(int *)a==*(int *)b){ return ((Str *)b)->y-((Str *)a)->y; } return *(int *)b-*(int *)a; } int main(){ int i, j; scanf("%d", &n); for(i=0;i<n*3;++i){ scanf("%d%d", &str[i].x, &str[i].y); str[i].idx=i+1; } qsort(str, 3*n, sizeof(Str), cmp); for(i=0;i<n;++i){ for(j=0;j<2;++j){ printf("%d ", str[i*3+j].idx); } printf("%d\n", str[i*3+j].idx); } }
#Verdict Execution timeMemoryGrader output
Fetching results...