排序题目练习（Ignatius and the Pincess IV、排序、Clock、排名）

HDJ排序题目练习

HDU Sort

1. HDU 1029 Ignatius and the Pincess IV
2. HDU 1106 排序
3. HDU 1209 Clock
4. HDU 1236 排名      

 

Ignatius and the Pincess IV

Problem Description

"OK, you are not too bad, em... But you can never pass the next test." feng5166 says.

"I will tell you an odd number N, and then N integers. There will be a special integer among them, you have to tell me which integer is the special one after I tell you all the integers." feng5166 says.

"But what is the characteristic of the special integer?" Ignatius asks.

"The integer will appear at least (N+1)/2 times. If you can't find the right integer, I will kill the Princess, and you will be my dinner, too. Hahahaha....." feng5166 says.

Can you find the special integer for Ignatius?

 

Input

The input contains several test cases. Each test case contains two lines. The first line consists of an odd integer N(1<=N<=999999) which indicate the number of the integers feng5166 will tell our hero. The second line contains the N integers. The input is terminated by the end of file.

 

Output

For each test case, you have to output only one line which contains the special number you have found.

 

Sample Input

5 1 3 2 3 3 11 1 1 1 1 1 5 5 5 5 5 5 7 1 1 1 1 1 1 1

 

Sample Output

3 5 1

 

思路：用map存储输入数据并计算每个数出现的次数后，map容器按照key自动排序，但value的排序需要通过自定义的结构体pai进行转储，然后对结构体进行排序便得到value最大的数字。

注意map进行循环遍历的方法以及调用key和value的方法。

#include <iostream>
#include <stdio.h>
#include <queue>
#include <string.h>
#include <algorithm>
#include <map>

using namespace std;

/*
找到最少出现（n+1）/2次的special number
*/
const int maxn=1000000;
map<int,int> m;
struct pai
{
    int key,value;
}p[maxn];
bool cmp(const pai &a,const pai &b)
{
    return a.value<b.value;
}
int main()
{
    int n,x,i;
    map<int,int>::iterator iter;
    while (cin >>n)
    {
        m.clear(); // map容器的清空方法？
       // m.erase(m.begin(),m.end());
        for (int i=0;i<n;i++)
        {
            cin >>x;
            m[x]++;
        }
        // 把map中的键值对转储到pair中形成结构体数组
        int k=0;
        iter=m.begin();
        while (iter!=m.end())
        {
            p[k].key=iter->first;
            p[k].value=iter->second;
            k++;iter++;
        }

        sort(p,p+k,cmp);
        cout <<p[k-1].key<<endl;
    }
    return 0;
}

map的基本使用方法：https://www.cnblogs.com/empty16/p/6395813.html

map的迭代遍历方法：https://blog.csdn.net/u010429424/article/details/75332700

 

排序

Problem Description

输入一行数字，如果我们把这行数字中的‘5’都看成空格，那么就得到一行用空格分割的若干非负整数（可能有些整数以‘0’开头，这些头部的‘0’应该被忽略掉，除非这个整数就是由若干个‘0’组成的，这时这个整数就是0）。

你的任务是：对这些分割得到的整数，依从小到大的顺序排序输出。

 

 

Input

输入包含多组测试用例，每组输入数据只有一行数字（数字之间没有空格），这行数字的长度不大于1000。  

输入数据保证：分割得到的非负整数不会大于100000000；输入数据不可能全由‘5’组成。

 

 

Output

对于每个测试用例，输出分割得到的整数排序的结果，相邻的两个整数之间用一个空格分开，每组输出占一行。

 

 

Sample Input

0051231232050775

 

 

Sample Output

0 77 12312320

#include <iostream>
#include <stdio.h>
#include <queue>
#include <string.h>
#include <algorithm>
#include <map>
#include <vector>

using namespace std;
/*
可能会有连续的5出现，不应该只跳过一个五

最后一个数字可能不是5，所以\0也是一个分界符
*/
vector<int> a;
char s[1001];
void push_into_vector(int i,int j)
{
    // s[i-j-1]进入vector中
    if (i==j) return ;
    int sum=0;
    int k=1;
    int t=j-i;
    while (t--)
    {
        sum+=(s[--j]-'0')*k;
        k=k*10;
    }
    a.push_back(sum);
}
int main()
{

    int i,j,k;
    while (cin>>s)
    {
        i=0;j=0;
        while (!a.empty()) a.pop_back();
        while (s[i]!='\0')
        {
            while (s[j]!='5'&&s[j]!='\0') j++;
            k=j;
            while (s[k]=='5') k++;
            push_into_vector(i,j);
            i=k;j=i;
        }
        sort(a.begin(),a.end());
        for (i=0;i<a.size()-1;i++) cout << a[i] <<" ";
        cout << a[i]<<endl;
    }
    return 0;
}

Clock

 

Problem Description

 

There is an analog clock with two hands: an hour hand and a minute hand. The two hands form an angle. The angle is measured as the smallest angle between the two hands. The angle between the two hands has a measure that is greater than or equal to 0 and less than or equal to 180 degrees.

Given a sequence of five distinct times written in the format hh : mm , where hh are two digits representing full hours (00 <= hh <= 23) and mm are two digits representing minutes (00 <= mm <= 59) , you are to write a program that finds the median, that is, the third element of the sorted sequence of times in a nondecreasing order of their associated angles. Ties are broken in such a way that an earlier time precedes a later time.

For example, suppose you are given a sequence (06:05, 07:10, 03:00, 21:00, 12:55) of times. Because the sorted sequence is (12:55, 03:00, 21:00, 06:05, 07:10), you are to report 21:00.

 

 

Input

 

The input consists of T test cases. The number of test cases (T) is given on the first line of the input file. Each test case is given on a single line, which contains a sequence of five distinct times, where times are given in the format hh : mm and are separated by a single space.

 

 

Output

 

Print exactly one line for each test case. The line is to contain the median in the format hh : mm of the times given. The following shows sample input and output for three test cases.

 

 

Sample Input

 

3 00:00 01:00 02:00 03:00 04:00 06:05 07:10 03:00 21:00 12:55 11:05 12:05 13:05 14:05 15:05

 

 

Sample Output

 

02:00 21:00 14:05

 

 

#include <iostream>
#include <stdio.h>
#include <queue>
#include <string.h>
#include <algorithm>
#include <map>
#include <vector>
#include <math.h>

using namespace std;
/*
abs:int 
fabs:float 
这里除以2极有可能是浮点类型的
*/
struct node
{
    int h,m;
    float angle;
}a[6];
int cmp(node x,node y)
{
    if(x.angle!=y.angle)
    return x.angle<y.angle;
    return x.h<y.h; // 角度相同时按照小时进行排序
}
int main()
{
    int t,hh;
    while (cin>>t)
    {
        while (t--)
        {
            for (int i=0;i<5;i++)
            {
                scanf("%d:%d",&a[i].h,&a[i].m);
                // 作为整型的输入方式即可，用字符串太麻烦
            //    cout << a[i].h<<":"<<a[i].m<<endl;

                if (a[i].h>=12) hh=a[i].h-12;
                else hh=a[i].h;
                    a[i].angle=fabs(30.0*(hh)-6.0*a[i].m+a[i].m/2.0);
                if (a[i].angle>180) a[i].angle=360-a[i].angle;
            }
            sort(a,a+5,cmp);
            printf("%02d:%02d\n",a[2].h,a[2].m);

        }
    }


    return 0;
}

 

 排名

 

今天的上机考试虽然有实时的Ranklist，但上面的排名只是根据完成的题数排序，没有考虑 
每题的分值，所以并不是最后的排名。给定录取分数线，请你写程序找出最后通过分数线的 
考生，并将他们的成绩按降序打印。 

Input

 

测试输入包含若干场考试的信息。每场考试信息的第1行给出考生人数N ( 0 < N 
< 1000 )、考题数M ( 0 < M < = 10 )、分数线（正整数）G；第2行排序给出第1题至第M题的正整数分值；以下N行，每行给出一 
名考生的准考证号（长度不超过20的字符串）、该生解决的题目总数m、以及这m道题的题号 
（题目号由1到M）。 
当读入的考生人数为0时，输入结束，该场考试不予处理。 

 

 

Output

 

对每场考试，首先在第1行输出不低于分数线的考生人数n，随后n行按分数从高 
到低输出上线考生的考号与分数，其间用1空格分隔。若有多名考生分数相同，则按他们考 
号的升序输出。 

 

 

Sample Input

 

4 5 25 10 10 12 13 15 CS004 3 5 1 3 CS003 5 2 4 1 3 5 CS002 2 1 2 CS001 3 2 3 5 1 2 40 10 30 CS001 1 2 2 3 20 10 10 10 CS000000000000000001 0 CS000000000000000002 2 1 2 0

 

 

Sample Output

 

3 CS003 60 CS001 37 CS004 37 0 1 CS000000000000000002 20

 

 

 

#include <iostream>
#include <stdio.h>
#include <queue>
#include <string.h>
#include <algorithm>
#include <map>
#include <vector>
#include <math.h>

/*
成绩相同时按照考号升序进行排序；
考察的主要是结构体数据的排序过程。

*/
using namespace std;
int n,m,line;
int grade[11];
struct stu
{
    char sno[50];
    int num;
    int no[11];
}s[1001];
bool cmp(const stu &a,const stu &b)
{
    if (a.num!=b.num)
    return a.num > b.num;
    else
    {
        return strcmp(a.sno,b.sno)<0;
    }

}
int main()
{
    while (scanf("%d%d%d",&n,&m,&line)!=EOF)
    {
        if (n==0) break;
        for (int i=0;i<m;i++) scanf("%d",&grade[i]);

        int sum;
        int cnt=0;
        for (int i=0;i<n;i++)
        {
            scanf("%s %d",&s[i].sno,&s[i].num);
            sum=0;
            for (int j=0;j<s[i].num;j++)
            {
                scanf("%d",&s[i].no[j]);
                sum+=grade[s[i].no[j]-1];
            }
            s[i].num=sum;
            if (sum>=line) cnt++;
        }
        sort(s,s+n,cmp);
        int i=0;
        printf("%d\n",cnt);
        while (n--&&s[i].num>=line)
        {
            printf("%s %d\n",s[i++].sno,s[i].num);
        }


    }


    return 0;
}

 

 

 

 

八大排序算法复习