1055. The World's Richest (25)
来源:互联网 发布:编程猫加盟 编辑:程序博客网 时间:2024/05/18 10:05
1055. The World’s Richest (25)
#include <stdio.h>#include <stdlib.h>#include <string.h>struct record{ char name[10]; int age; int worth;}s[100001];int comp(const void*a,const void*b){ struct record *p=(struct record*)a,*q=(struct record*)b; if(p->worth!=q->worth) return q->worth-p->worth; else if(p->age!=q->age) return p->age-q->age; else return strcmp(p->name,q->name);}int main(){ int n,k,i,j; scanf("%d %d",&n,&k); for(i=0;i<n;i++) { scanf("%s %d %d",s[i].name,&s[i].age,&s[i].worth); } qsort(s,n,sizeof(struct record),comp); for(j=0;j<k;j++) { int max,down,up,c=0; scanf("%d %d %d",&max,&down,&up); printf("Case #%d:\n",j+1); for(i=0;i<n;i++) { if(s[i].age>=down&&s[i].age<=up) { printf("%s %d %d\n",s[i].name,s[i].age,s[i].worth); c++; } if(c==max)break; } if(c==0) printf("None\n"); } return 0;}
0 0
- 【PAT】1055. The World's Richest (25)
- pat 1055. The World's Richest (25)
- pat 1055. The World's Richest (25)
- 1055. The World's Richest (25)
- 1055. The World's Richest (25)
- 1055. The World's Richest (25)
- 1055. The World's Richest (25)
- PAT: 1055. The World's Richest (25)
- 1055. The World's Richest (25)
- 1055. The World's Richest (25)
- 1055. The World's Richest (25)
- 1055. The World's Richest (25)
- 1055. The World's Richest (25)
- 1055. The World's Richest (25)
- 1055. The World's Richest (25)
- PAT 1055. The World's Richest (25)
- 1055. The World's Richest (25)
- 1055. The World's Richest (25)
- laravel 指定 版本安装
- LinkedHashMap实现原理
- leetcode (18) - 4Sum
- js基础语法
- AspectJ切入点语法详解
- 1055. The World's Richest (25)
- Android实验五之把数据存到SD卡
- 杭电1896(题意详解+代码)(优先队列)之Stones
- windows下安装PHP redis扩展
- C++之虚函数、多态、抽象类
- Apache重写去除入口文件index.php
- hibernate jpa 注解 @Temporal(TemporalType.DATE) 格式化时间日期,页面直接得到格式化类型的值
- Robomasters视觉教程
- 最大似然估计