sort(HDU-3293)

第12步 支持向量机(SVM) 搭建SVM 阅读详情
Problem Description
As is known to all, long long ago sailormoon once was an association of fighters. Till now, sailormoon is also an association of girls. Owe to some unknown reasons, girls are necessary to fight for peace.
Their boss, lcy, wants to strengthen their ability, so he give them his precious collections---weapons for many years. Because these collections are really age-old, it is hard to recognize from one to another. So girls intend to sort them before they use. Each weapon has its name, origin and level of harmfulness ( level contains three ranks: wonderful, good, so-so).
In order to make it clear, girls want to sort like this:
firstly,sort according to the origin (sort by lexicographic order), if two or more have the same origin, they will be sorted together;
secondly, sort according ranks, wonderful is the best, good is next, the third is so-so;
thirdly, if two or more have same origin and rank, sort them according to the lexicographic order.


 

Input
Input contains multiply cases. Each case contains several lines. First line is an integer N(0<N<=500), representing the number of weapons. Then N lines follows. Each line represent a kind of weapon, and contains a set of strings representing name, origin and level of harmfulness. 
Each string will not exceed 20 characters.
Sure that same origin will not exist the same weapon.
 

Output
Please output your list after sorting (format according to sample, pay attention to the spaces,ten spaces need ^ ^).
 

Sample Input
5 knife qizhou so-so gun qizhou wonderful knife zhengzhou good stick zhengzhou good rope shengzhou so-so
 

Sample Output
Case 1 qizhou: gun wonderful knife so-so shengzhou: rope so-so zhengzhou: knife good stick good
 
代码如下:
#include<bits/stdc++.h>
using namespace std;
struct pp
{
    string ori,na,le;
    int l;
};
pp p[510];
bool cmp(const pp&a,const pp&b)
{
    if(a.ori!=b.ori)
        return a.ori<b.ori;
    else if(a.l!=b.l)
        return a.l<b.l;
    else
        return a.na<b.na;
}
set<string>origin;
int main()
{
    int n,t=1;
    while(cin>>n)
    {
        string a,b,c;
        for(int i=0;i<n;i++)
        {
            cin>>p[i].na>>p[i].ori>>p[i].le;
            origin.insert(p[i].ori);
            if(p[i].le[0]=='w')
                p[i].l=1;
            else if(p[i].le[0]=='g')
                p[i].l=2;
            else
                p[i].l=3;
        }
        int l=0;
        sort(p,p+n,cmp);
        cout<<"Case "<<t<<endl;
        for(set<string>::iterator it=origin.begin();it!=origin.end();it++)
        {
            cout<<*it<<":\n";
            for(;l<n&&*it==p[l].ori;l++)
                cout<<"          "<<p[l].na<<" "<<p[l].le<<endl;
        }
        t++;
        origin.clear();
    }
    return 0;
}


栅格数据做相关性分析前的预处理(批量定义投影、栅格投影、重采样) 最近在做两个栅格数据的相关性分析,这个最主要的是两个栅格数的行列号是一致的(也就是说坐标系、分辨率一致),那么标准的栅格数据的分辨率是以米的形式存在的,但是有一些栅格数据是以度为单位存在的,所以在做分析前,一定要先把其转换为米,否则在重采样的时候就会出错。(相关文章——栅格数据以度为单位变为以米为单位的简单做法)当然,在变其分辨率的单位前,一定要将其坐标系转换为一致。所以就有以下的步骤(如何将两个栅格数据的坐标系、分辨率的单位和分辨率一致) 1.首先,要看两个栅格数据的坐标系是否一致,如果不一致,要先统一到 阅读详情

相关推荐

2023东华大学OJ机试题22-70

东华大学计算机考研复试机试22 约瑟夫环223、整除的尾数24、回文质数25、汽水瓶26、阶乘最后的非0位27、算菜价28、 水果价格29、求奇数的乘积30、求最晚和最早日期31、素数32、计算e33 数字之和34 繁殖问题35 奇妙的数字36 整除的尾数37 黑色星期五38 树39 约瑟夫环40 最大与最小41 环42 求数列项43 最高频率44 三艘船45 回文数46 特殊四位数47 最大值48 数列149 修理牛棚50 按要求输出序列51 部落人乘法52 序列53 双重回文数54 等差数列55 人见人

m0_49263811的博客 2600

HDU3293:sort

Problem Description As is known to all, long long ago sailormoon once was an association of fighters. Till now, sailormoon is also an association of girls. Owe to some unknown reasons, girls are nece

ACM!荣耀之路! 1977

FP7195升降压恒流驱动IC:从AC/DC 12~24V输入到稳定输出的高效电源设计实战

本文详细解析FP7195升降压恒流驱动IC的工作原理与应用实战。该芯片支持4.5V-32V宽输入范围,能自动切换升降压模式并保持输出恒定,特别适用于车载LED照明、工业电源等电压波动场景。通过实际案例分享PCB布局、元件选型及调试技巧,帮助工程师实现高效稳定的电源设计。

vodka的博客 957

HDU 3293 由简单排序引发出的一点思考

C - sort Time Limit:1000MS     Memory Limit:32768KB     64bit IO Format:%I64d & %I64u Submit Status Description As is known to all, long long ago sailormoon once was an association of

DT2131 512

ZYNQ-Video out IP与Video Timing Controller IP协同工作模式解析

本文深入解析了ZYNQ平台上Video out IP与Video Timing Controller IP的协同工作模式,详细介绍了它们的架构、工作原理及配置要点。通过AXI4-Stream接口实现高效视频数据传输,并结合HDMI输出系统设计实践,为开发者提供了实用的调试技巧和性能优化建议。

redis7keeper的博客 637

解决WSL2网络隔离:Ubuntu子系统共享Windows代理的3种方法

本文详细解析了WSL2的网络隔离特性,并提供了三种在Ubuntu子系统中共享Windows代理的实用方法:环境变量法、配置文件法和系统服务法。通过具体代码示例和方案对比,帮助开发者快速解决WSL2网络访问问题,实现一键设置代理,提升开发效率。

weixin_29295541的博客 452

hdu 3293

这一题死的很悲剧,就n值问题,起初我还一直以为是排序的cmp出问题了,检查它,却忽略了后面的检查……呜呜~~~~(&gt;_&lt;)~~~~ 竟然wa了那么多次,而且用了那么长时间,如此基础的题目,看来我检查错误的能力还有待改善啊~~~ View Code #include &lt;cstdio&gt;#include &lt;cstdlib&gt;#include &lt;...

aoyuan4706的博客 162

保姆级教程:从零到飞,用QGC地面站搞定PX4无人机全流程配置(含避坑指南)

本文提供了一份详细的QGC地面站使用教程,指导用户从零开始配置PX4无人机,涵盖固件烧录、传感器校准、遥控器设置及航点规划等关键步骤,并包含实用的避坑指南,帮助新手顺利完成首飞。

weixin_30329623的博客 222

HDU 3293

字符串的排序模拟: 以后最好都用 qsort。这里用sort排序出来的结果不对。sort 是用大于小于号来返回bool值进行排序。qsort 则返回int类型,从而进行排序 PS:升序用后一个减去前一个 #include #include #include #include using namespace std; struct Weapon { char name[21]

For free 520

本地构建AI智能分析助手之 05 PandasAI如何MySQL数据库 (教程含源码)

与 PostgreSQL 连接器类似,MySQL 连接器允许您连接到 MySQL 数据库。即使您不熟悉 MySQL 或 PandasAI,它也设计得易于使用。

iCloudEnd的博客 704

【深度学习新浪潮】OpenClaw跟机器人行业有哪些很好的研究结合点?

OpenClaw正通过"AI大脑+机器人肢体"的深度融合,重新定义机器人与人类的交互方式和自主操作能力。近期ROSClaw框架发布、人形机器人集成和空间计算试验等进展,标志着OpenClaw已从概念验证阶段进入实际应用落地期,为机器人行业带来了自然语言控制普及化具身智能平民化和跨平台开发标准化三大变革机遇。

专注:太空算力、AI infra、异构调度、大模型成本工程 229

hdu 3293 sort

hdu 3293 sort 题目: sort Time Limit: 3000/1000 MS (Java/Others)    Memory Limit: 65535/32768 K (Java/Others) Total Submission(s): 752    Accepted Submission(s): 355 Problem Descriptio

问鼎63的博客 566

掌握RDMA核心:从同步构建到异步事件的连接艺术

本文深入解析RDMA编程中的双模式设计,揭示同步配置与异步事件机制的协作关系。第一部分阐述同步函数rdma_bind_addr和rdma_listen的本地化角色,强调它们仅完成本地端点配置。第二部分剖析异步事件模型,重点分析连接请求和建立事件的处理流程。通过完整生命周期序列图展示两种模式的交互过程,并提供错误处理、资源管理和性能调优的实用建议。文章指出,理解同步本地配置与异步网络响应这一责任划分,是掌握RDMA编程的关键所在。

数字人生 283

Hdu 3293 - sort

排序题    字典序     题目的大致意思是: 每一种武器都有它们的名字,产地,和伤害等级。 在排序时,先排产地。按字典序从a ~ z 排序,如果一个产地里有多种武器,那也把武器排列在一起;然后,在每一个产地里,再根据它们的伤害等级排列,从高级到低级分别是 wonderful  ~  good  ~  so-so  ;最后如果两个或者两个以上的武器有相同的产地和伤害等级,那就根据名字的

Chuck的博客 526

TMS_WebGMaps_1.9.8.0_Full_Source

TMS_WebGMaps_1.9.8.0_Full_Source 全源码 delphi cbuilder

Data-Structures-and-Algorithm-Analysis-in-Java.pdf

作者: Weiss, Mark A. 出版社: Addison Wesley Data Structures and Algorithm Analysis in Java is an &ldquo;advanced algorithms&rdquo; book that fits between traditional CS2 and Algorithms Analysis courses. In the old ACM Curriculum Guidelines, this course was known as CS7. This text is for readers who want to learn good programming and algorithm analysis skills simultaneously so that they can develop such programs with the maximum amo...

HDU3293 sort 【排序】

sort Time Limit: 3000/1000 MS (Java/Others)    Memory Limit: 65535/32768 K (Java/Others) Total Submission(s): 694    Accepted Submission(s): 324 Problem Description As is known to all, long long

星尘 437

精雕软件(JDpaint) 5.5 绿色版

精雕软件(JDpaint) 5.5 绿色版精雕软件(JDpaint) 5.5 绿色版精雕软件(JDpaint) 5.5 绿色版

HDU 3293 sort

sort Time Limit: 3000/1000 MS (Java/Others)    Memory Limit: 65535/32768 K (Java/Others) Total Submission(s): 591    Accepted Submission(s): 271 Problem Description As is known to all, long

忆梦 926

霍尼韦尔SoftMaster使用说明

霍尼韦尔SoftMaster使用说明

HDU 3293 sort [Ad Hoc]

Description三个关键字 都是字符串,排序Algorithm用C++ 的 sort函数 和 字符串类Code#include <cstdio> #include <iostream> #include <algorithm> using namespace std; const int maxn = 500 + 9; int t = 0; int n; struct V { string

more time 394

HDU 3293:sort

Problem Description As is known to all, long long ago sailormoon once was an association of fighters. Till now, sailormoon is also an association of girls. Owe to some unknown reasons, girls are nece

Valieli的博客 503

HDU 3293 sort

这里最好用qsort排序,而在写cmp函数时要注意,对rank进行排序是从大到小,所以那里不要写反了,还有排序优先级是origin,,rank,字典序,这里别弄错了,我悲剧额,对rank排序一直是错的,最后听小白一说才恍然大悟,在此鸣谢小白,直接上代码 #include&lt;stdio.h&gt; #include&lt;stdlib.h&gt; #include&lt;string....

weixin_30823833的博客 87

HDU-3293-sort

sort Time Limit : 3000/1000ms (Java/Other)Memory Limit : 65535/32768K (Java/Other) Total Submission(s) : 8Accepted Submission(s) : 3 Font:Times New Roman|Verdana|Georgia Font Size:←...

weixin_33938733的博客 75

HDU 3293 sort(结构体排序)

Problem Description As is known to all, long long ago sailormoon once was an association of fighters. Till now, sailormoon is also an association of girls. Owe to some unknown reasons, girls a...

weixin_30535565的博客 151

武器排序HDU3293:sort

首先声明,我是一个菜鸟。一下文章中出现技术误导情况盖不负责 Problem Description As is known to all, long long ago sailormoon once was an association of fighters. Till now, sailormoon is also an association of g...

weixin_30621919的博客 101

HDU - 3293B - sort与HDU - 1263 水果 pair的使用

s is known to all, long long ago sailormoon once was an association of fighters. Till now, sailormoon is also an association of girls. Owe to some unknown reasons, girls are necessary to fight for pea

深海沧澜的博客 526

HDU--杭电--3293--sort--结构体排序

sort Time Limit: 3000/1000 MS (Java/Others)    Memory Limit: 65535/32768 K (Java/Others) Total Submission(s): 596    Accepted Submission(s): 274 Problem Description As is known to all, long

浩爷地带,你的地盘听我的.... 842

HDOJ1872(稳定排序)

稳定排序 Time Limit: 3000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 1066Accepted Submission(s): 408 Problem Description 大家都知道,快速排序是不稳定的排序方法。 如果对于...

weixin_30402085的博客 491
上一篇: Bombing(HDU-4022)
下一篇: Intelligent IME(HDU-4287)
绿蚁.r
博客等级 码龄10年 4粉丝 37原创
评论
成就一亿技术人!
拼手气红包6.0元
还能输入1000个字符
 
 条评论被折叠 查看
添加红包

请填写红包祝福语或标题

个

红包个数最小为10个

元

红包金额最低5元

当前余额3.43元 前往充值 >
需支付:10.00元
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付元
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值