简单结构体排序
2016-05-28 11:19
218 查看
【题意】打气球的志愿者们比较蠢!于是,打的气球越多,题目越水>_<。我们知道气球数,问你按照什么顺序做题,能够得以从易到难的顺序解决所有问题。
#include<stdio.h>
#include<iostream>
#include<string>
#include<algorithm>
using namespace std;
const int N = 12, M = 0, Z = 1e9 + 7, ms63 = 0x3f3f3f3f;
int casenum, casei;
int n, m;
pair<int, string>a
;
void solve()
{
scanf("%d", &casenum);
for (casei = 1; casei <= casenum; ++casei)
{
scanf("%d", &n);
for (int i = 1; i <= n; ++i)cin >> a[i].second >> a[i].first;
sort(a + 1, a + n + 1);
for (int i = n; i > 1; --i)cout << a[i].second << ' ';
cout << a[1].second << endl;
}
}
int main()
{
solve();
return 0;
}
#include<stdio.h>
#include<iostream>
#include<string>
#include<algorithm>
using namespace std;
const int N = 12, M = 0, Z = 1e9 + 7, ms63 = 0x3f3f3f3f;
int casenum, casei;
int n, m;
pair<int, string>a
;
void solve()
{
scanf("%d", &casenum);
for (casei = 1; casei <= casenum; ++casei)
{
scanf("%d", &n);
for (int i = 1; i <= n; ++i)cin >> a[i].second >> a[i].first;
sort(a + 1, a + n + 1);
for (int i = n; i > 1; --i)cout << a[i].second << ' ';
cout << a[1].second << endl;
}
}
int main()
{
solve();
return 0;
}
相关文章推荐
- openwrt编译日志
- gem 镜像安装--这个坑必须记住
- pooling mean max 前向和反向传播
- JS设计模式之建造者模式
- CSS选择器优先级
- Linux设备驱动之Kobject、Kset
- 在windows下的eclipse中编写provider
- 黄金分割法与单峰函数求极值
- acm 3 1017 背包问题
- An exception occurred while acquiring a poolable resource. Will retry.
- Android音频开发(3):如何播放一帧音频
- 解决虚拟机打不开的问题
- errno 错误码
- hbases索引技术:Lily HBase Indexer介绍
- java堆和栈区别
- 动态网络拓扑演变:局部动态到全局的相变|TopologicalEvolutionofDynamicalNetworks: Global Criticality from Local Dynamics
- 在单链表中删除倒数第k个节点(java实现)
- 判断两条线段是否相交
- 基础总结--Activity的四种launchMode
- 用Cookie实现web网站您浏览过其他的商品