题目
Sample Input
2
5
78:44:76:F3:95:BE -43 1380
80:1F:02:BA:90:3E -85 532
E8:CC:18:F2:4A:48 -71 336
F8:35:DD:B8:CE:92 -83 972
BC:99:11:62:23:E7 -83 528
2
E8:CC:18:F2:4A:48 -81 1336
FA:45:DD:B8:FE:72 -63 972
Sample Output
E8:CC:18:F2:4A:48 -71
BC:99:11:62:23:E7 -83
F8:35:DD:B8:CE:92 -83
FA:45:DD:B8:FE:72 -63
想法
这道题就纯模拟,读入字符串S和两个数字r和t,如果t>1000就直接筛去,其他的按照r降序排列,r相同s字典序排列。
很简单,可以直接敲代码。
AC代码
#include<bits/stdc++.h>
using namespace std;
#define rep(i,a,b) for(int i=a;i<=b;++i)
#define pre(i,a,b) for(int i=a;i>=b;--i)
#define m(x) memset(x,0,sizeof x)
typedef long long ll;
const int maxn = 1e4+10;
#define PI acos(-1)
typedef struct node
{
char str[50];
int r,t;
}Node;
vector<Node>v;
//排序
bool cmp(Node a,Node b)
{
if(a.r==b.r)return a.str<b.str;
else return a.r>b.r;
}
int main()
{
int T,n;
string str;
scanf("%d",&T);
while(T--)
{
scanf("%d",&n);
rep(i, 0, n-1)
{
Node temp;
//读入数据
scanf("%17s %d %d",temp.str,&temp.r,&temp.t);
if(temp.t<=1000)v.push_back(temp);
//printf("%s %d %d\n",num[k].str,num[k].r,num[k].t);
}
sort(v.begin(),v.end(),cmp);
int len = (int)v.size();
if(len<=3)
rep(i, 0, len-1)printf("%s %d\n",v[i].str,v[i].r);
else rep(i, 0, 2)printf("%s %d\n",v[i].str,v[i].r);
v.clear();
}
return 0;
}