# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
3928 | shinhj88 | Divide into triangle (kriii1_D) | C++98 | 0 ms | 1236 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include<stdio.h>
#include<stdlib.h>
#include <algorithm>
#include <vector>
using namespace std;
typedef struct M_str{
int x, y, idx;
};
vector<M_str> m_str;
int n;
int cmp(const M_str &a,const M_str &b)
{
if(a.x==b.x)return a.y>b.y;
return a.y>b.y;
}
int main(){
int i, j;
scanf("%d", &n);
m_str.resize(n*3);
for(i=0;i<n*3;++i){
scanf("%d%d", &m_str[i].x, &m_str[i].y);
m_str[i].idx=i+1;
}
sort(m_str.begin(),m_str.end(),cmp);
for(i=0;i<n;++i){
for(j=0;j<2;++j){
printf("%d ", m_str[i*3+j].idx);
}
printf("%d\n", m_str[i*3+j].idx);
}
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |