fork download 
  1. // task: <link_to_task>
  2. // date: XX month XXXX
  3.  
  4. #include <bits/stdc++.h>
  5. using namespace std;
  6.  
  7. // base types of data
  8. using ll = long long;
  9. using ull = unsigned long long;
  10. using pii = pair<int,int>;
  11. using pll = pair<ll,ll>;
  12.  
  13. // all types of arrays
  14. template<typename T> using vc = vector<T>;
  15. using vi = vc<int>;
  16. using vll = vc<ll>;
  17.  
  18. // all type of matrixes
  19. template<typename T> using vcc = vc<vc<T>>;
  20. using vvi = vcc<vi>;
  21. using vvll = vcc<vll>;
  22.  
  23. // boolean answers
  24. void printBool(string ans) { cout << ans << endl; }
  25. bool YES(bool b=0) { printBool(b ? "YES" : "NO"); }
  26. bool Yes(bool b=0) { printBool(b ? "Yes" : "No"); }
  27. bool yes(bool b=0) { printBool(b ? "yes" : "no"); }
  28.  
  29. // gcd, lcm
  30. template<typename T> T gcd(T a, T b) { T t; while(b) { t = a % b; a=b; b=t; } return a;}
  31. template<typename T> T lcm(T a, T b) { return a * b / gcd(a,b); }
  32.  
  33.  
  34. // SOLVE OF PROBLEM
  35. void quicksort_heights(vc<short> heights, vc<string> names, int start, int end) {
  36.   if (start >= end) return;
  37.  
  38.   int mid = (start + end) / 2;
  39.   short X = heights[mid];
  40.   int L = start, R = end;
  41.   while (L <= R) {
  42.     while (heights[L] < X) L += 1;
  43.     while (heights[R] > X) R -= 1;
  44.  
  45.     if (L <= R) {
  46.       swap(heights[L], heights[R]);
  47.       swap(names[L], names[R]);
  48.       L += 1;
  49.       R -= 1;
  50.     }
  51.   }
  52.  
  53.   quicksort_heights(heights, names, start, R);
  54.   quicksort_heights(heights, names, L, end);
  55. }
  56.  
  57. void quicksort_names(vc<short> heights, vc<string> names, int start, int end) {
  58.   if (start >= end) return;
  59.  
  60.   int mid = (start + end) / 2;
  61.   string X = names[mid];
  62.   int L = start, R = end;
  63.   while (L <= R) {
  64.     while (names[L] < X) L += 1;
  65.     while (names[R] > X) R -= 1;
  66.  
  67.     if (L <= R) {
  68.       swap(heights[L], heights[R]);
  69.       swap(names[L], names[R]);
  70.       L += 1;
  71.       R -= 1;
  72.     }
  73.   }
  74.  
  75.   quicksort_names(heights, names, start, R);
  76.   quicksort_names(heights, names, L, end);
  77. }
  78.  
  79. void solve() {
  80.   int N; cin >> N;
  81.  
  82.   vc<string> names (N, "");
  83.   vc<short> heights (N, 0);
  84.  
  85.   for (int i = 0; i < N; i++) {
  86.     cin >> names[i];
  87.     cin >> heights[i];
  88.   }
  89.  
  90.   quicksort_names(heights, names, 0, N-1);
  91.   quicksort_heights(heights, names, 0, N-1);
  92.  
  93.   for (int i = 0; i < N; i++) {
  94.     cout << heights[i] << " " << names[i] << " ";
  95.   }
  96.   cout << endl;
  97. }
  98.  
  99. signed main() {
  100.   solve();
  101.   return 0;
  102. }
  103.  
Success #stdin #stdout 0s 5312KB
comments (?)
stdin 
3
Vasya 180
Petya 192
Masha 167
stdout 
180 Vasya 192 Petya 167 Masha
https://ideone.com/esPI4J
language:
C++ (gcc 8.3)
created:
4 days ago
visibility:
public

Share or Embed source code

Discover > Sphere Engine API

The brand new service which powers Ideone!

Discover > IDE Widget

Widget for compiling and running the source code in a web browser!