\quad 一个模拟题,注意按规则写程序即可。
#include <bits/stdc++.h>
using namespace std;
bool cmp(const pair<string, int> &p1, const pair<string, int> &p2)
{
if(p1.second!=p2.second) return p1.second>p2.second;
else return p1.first<p2.first;
}
void solve(vector<pair<string, int> > &vec)
{
int len = vec.size();
if(len%2==0)
{
len = len-1;
cout << vec[len].first << " ";
}
vector<pair<string, int> > t(len);
t[len/2] = vec[0];
int left = 0;
int right = len-1;
for (int i = len-1; i >= 1; i=i-2)
{
t[left] = vec[i-1];left++;
t[right] = vec[i];right--;
}
for (int i = 0; i < t.size(); ++i)
{
cout << t[i].first;
if(i!=t.size()-1) cout << " ";
}
cout << endl;
}
int main(int argc, char const *argv[])
{
int n, k;
cin >> n >> k;
vector<pair<string, int> > vec;
for (int i = 0; i < n; ++i)
{
string name;
int height;
cin >> name >> height;
pair<string, int> p = make_pair(name, height);
vec.push_back(p);
}
sort(vec.begin(), vec.end(), cmp);
int num = n/k;
int last = num+n%k;
vector<pair<string, int> > temp;
for(int i=0; i<last; i++)
{
temp.push_back(vec[i]);
}
solve(temp);
for (int i = 0; i < k-1; ++i)
{
temp.clear();
for (int j = 0; j < num; ++j)
{
temp.push_back(vec[last+i*num+j]);
}
solve(temp);
}
return 0;
}