# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
3932 | 2013-08-31T09:28:27 Z | joonas | Divide into triangle (kriii1_D) | C++ | 0 ms | 0 KB |
#include <stdio.h> #include <algorithm> #include <vector> #include <utility> 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; }