https://pintia.cn/problem-sets/994805260223102976/problems/994805272021680128
题意:从高往低排序,高度相同按字典序升序排序,然后逆序安排位置,从前往后安排,前K-1排安排N/K人,第K排安排N-N/K*(K-1)行
我当时就是题意理解错了,在字典序那块,我以为是先从低到高,字典序升序排前K-1行,然后在每一行中,从高到低字典序顺序排,导致3,4点过不去
#include <bits/stdc++.h>
using namespace std;
const int maxn=10000;
struct node{
string name;
int h;
}a[maxn+5];
bool cmp(node x,node y){
if(x.h==y.h){
return x.name>y.name;
}
return x.h<y.h;
}
bool cmp2(node x,node y){
if(x.h==y.h){
return x.name<y.name;
}
return x.h>y.h;
}
bool cmp3(node x,node y){
return x.name<y.name;
}
vector<node>v[20],ans[20];
int main()
{
int N,K;
cin>>N>>K;
for(int i=1;i<=N;i++){
cin>>a[i].name>>a[i].h;
}
sort(a+1,a+1+N,cmp);
int u=1;
for(int j=1;j<K;j++){
for(int k=1;k<=N/K;k++){
v[j].push_back(a[u++]);
}
sort(v[j].begin(),v[j].end(),cmp2);
}
while(u<=N){
v[K].push_back(a[u++]);
}
sort(v[K].begin(),v[K].end(),cmp2);
for(int i=1;i<=K;i++){
ans[i].resize(v[i].size());
int t=0,flag=1;
for(int j=0;j<v[i].size();j++){
ans[i][v[i].size()/2+t*flag]=v[i][j];//中心点往两边扩展
if(flag>0)t++;
flag=-flag;
}
}
for(int i=K;i>=1;i--){
for(int j=0;j<ans[i].size();j++){
if(j!=0)cout<<" ";
cout<<ans[i][j].name;
}
cout<<endl;
}
return 0;
}