HDU 3293 sort
2011-08-04 21:00
211 查看
结构体排序,sort函数的运用!大意是名字不同的情况下,名字先按字典顺序排列,同名者看武器的等级,wonderful的先,good第二,soso最后!
武器等级一样的同样按字典顺序排列!
应该不用写注释了吧!我感觉都还好!有不懂得可以留言我会解答的!
武器等级一样的同样按字典顺序排列!
#include <iostream> #include <stdio.h> #include <string.h> #include <algorithm> usingnamespace std; struct node { char weapon1[21]; char name[21]; char rank[21]; int level; }; node nodes[510]; int cmp(node a,node b) { if(strcmp(b.name,a.name)==0) { if(strcmp(b.rank,a.rank)!=0) return a.level<b.level; else if(strcmp(b.weapon1,a.weapon1)>0) return1; else return0; } else if(strcmp(b.name,a.name)>0) return1; else return0; } int main() { int t=1; int n,i; while(scanf("%d",&n)!=EOF) { for(i=0;i<n;i++) { cin>>nodes[i].weapon1>>nodes[i].name>>nodes[i].rank; if(strcmp(nodes[i].rank,"wonderful")==0) nodes[i].level=1; else if(strcmp(nodes[i].rank,"good")==0) nodes[i].level=2; else nodes[i].level=3; } sort(nodes,nodes+n,cmp); cout<<"Case "<<t++<<endl; for(i=0;i<n;i++) { if(strcmp(nodes[i-1].name,nodes[i].name)!=0) cout<<nodes[i].name<<":"<<endl; cout<<""<<nodes[i].weapon1<<""<<nodes[i].rank<<endl; } } return0; }
应该不用写注释了吧!我感觉都还好!有不懂得可以留言我会解答的!
相关文章推荐
- HDU--杭电--3293--sort--结构体排序
- HDU 3293:sort
- sort(HDU-3293)
- HDU-3293-sort
- HDU 3293 sort(结构体排序)
- hdu 3293 sort
- HDU 3293 sort
- Hdu 3293 - sort
- HDU 3293 sort
- HDU 3293 sort
- HDU 2689 Sort it 简单树状数组入门
- HDU 1425 sort 题解
- hdu 1425 sort (水题,计数法)
- hdu---1425 sort
- hdu 2523(SORT AGAIN) hash
- hdu 1425 sort【hash方法】
- HDU 4324 topological_sort
- hdu 1425.sort
- hdu 1031 (partial sort problem, nth_element, stable_partition, lambda expression)
- HDU 5884 Sort 2016 ACM/ICPC Asia Regional Qingdao Online 1007