题目链接
1.0 有一个测点超时:
//所利用的思想为,先按要求对数据排好序,然后针对每组的序列,min,max对排好的数据
//进行筛选,符合即输出,同时设立计数器,防止所选数据超过最大值,且为0输出none。
#pragma warning(disable:4996);
#include <iostream>
#include<stdio.h>
#include<algorithm>
#include<string.h>
#include<string>
#include<stack>
#include<math.h>
#include<vector>
using namespace std;
const int maxn = 100005;
struct record {
char name[20];
int age;
int worth;
}rec[maxn];
bool cmp(record a, record b) {
if (a.worth != b.worth) return a.worth > b.worth;
else if (a.age != b.age) return a.age < b.age;
else return strcmp(a.name, b.name) < 0;
}//按照题目构造比较数据;
int main() {
int n, k;
scanf("%d%d", &n, &k);
for (int i = 0;i < n;i++)//读取数据;
{
scanf("%s %d %d", rec[i].name, &rec[i].age, &rec[i].worth);
}
sort(rec, rec + n, cmp);//排序;
for (int j = 1;j <=k;j++)
{
int m, max, min;
scanf("%d%d%d", &m, &min, &max);
printf("Case #%d:\n", j);
int t = 0;
for (int i = 0;i < n;i++)
{
if (rec[i].age <= max && rec[i].age >= min&&t<m) {
printf("%s %d %d\n", rec[i].name, rec[i].age, rec[i].worth);
t++;
}
}
if (t == 0) printf("None\n");
}
return 0;
}
2.0
因为m的范围仅在100内,所以我们进行预处理取出每个年龄段财富按要求排在前100的人放入另一个数组。查询操作在这里进行,降低时间复杂度;防止超时;
#pragma warning(disable:4996);
#include <iostream>
#include<stdio.h>
#include<algorithm>
#include<string.h>
#include<string>
#include<stack>
#include<math.h>
#include<vector>
using namespace std;
const int maxn = 100010;
int age[maxn] = { 0 };//某年龄的人数;
struct record {
char name[20];
int age;
int worth;
}rec[maxn],valid[maxn];//所有人,在各自年龄中财富值在100名之内的人
bool cmp(record a, record b) {
if (a.worth != b.worth) return a.worth > b.worth;
else if (a.age != b.age) return a.age < b.age;
else return strcmp(a.name, b.name) < 0;
}//按照题目构造比较数据;
int main() {
int n, k;
scanf("%d%d", &n, &k);
for (int i = 0;i < n;i++)//读取数据;
{
scanf("%s %d %d", rec[i].name, &rec[i].age, &rec[i].worth);
}
sort(rec, rec + n, cmp);//排序;
int validnum = 0;//存放到valid数组的人数;
for (int i = 0;i < n;i++)//提取出每个年龄中财富值在前一百的人,放入新数组,缩小循环范围,,在查找数据时,仅在vlid数组找,提高效率;
{
if (age[rec[i].age] < 100) {//年龄为rec[i].age的人数小于100时;
age[rec[i].age]++;//年龄为rec[i].age的人数+1;
valid[validnum++] = rec[i];//将rec[i]加入新数组中;
}
}
for (int j = 1;j <=k;j++)
{
int m, max, min;
scanf("%d%d%d", &m, &min, &max);
printf("Case #%d:\n", j);
int t = 0;//计数器;
for (int i = 0;i < validnum&&t<m;i++)
{
if (valid[i].age<= max && valid[i].age >= min) {
printf("%s %d %d\n", valid[i].name, valid[i].age, valid[i].worth);
t++;
}
}
if (t == 0) printf("None\n");
}
return 0;
}