| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 3929 | joonas | Divide into triangle (kriii1_D) | C++98 | 0 ms | 0 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 <iostream>
#include <algorithm>
#include <vector>
using namespace std;
vector<pair<int,int>> pt;
int main(){
int i,j, n, tmp;
scanf("%d", &n);
for(i=0; i < 3*n; ++i){
scanf("%d %d", &tmp, &tmp);
pt.push_back(pair<int,int>(i+1,tmp));
}
for(i=0; i < 3*n; ++i){
for(j=0; j < 3*n; ++j){
if( pt[i].second < pt[j].second ) swap( pt[i], pt[j] );
}
}
for(i=0; i < 3*n; i+=3){
for(j=i; j < i+3; ++j){
for(int k=i; k < i+3; ++k){
if( pt[j].first < pt[k].first ) swap( pt[j], pt[k] );
}
}
for(j=i; j < i+3; ++j) printf("%d ", pt[j].first);
printf("\n");
}
return 0;
}