1916 vector<Person>
vec(n);
1917 for(
int i = 0; i < n; i++) {
1920 cin >> name >> height;
1921 const auto p =
Person{name, height};
1924 sort(
vec.begin(),
vec.end());
1925 vector<deque<Person>> deq(k);
1926 for(
int i = 0; i < n / k + n % k; i++) {
1928 deq[k - 1].push_front(
vec.back());
1930 deq[k - 1].push_back(
vec.back());
1934 for(
int i = k - 2; i >= 0; i--) {
1935 for(
int j = 0; j < n / k; j++) {
1937 deq[i].push_front(
vec.back());
1939 deq[i].push_back(
vec.back());
1944 for(
int i = k - 1; i >= 0; i--) {
1945 for(
int j = 0; j < deq[i].size(); j++) {
1946 cout << deq[i][j].name;
1947 if(j != deq[i].size() - 1) {