水题，用结构体a了，用map居然wa了

Clock

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 6527    Accepted Submission(s): 2057

 

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

 

 

Source

Asia 2003（Seoul）

 

#include<iostream>
#include<cstdio>
#include<string.h>
#include<algorithm>
#include<cmath>
#include<map>
#include<vector>
using namespace std;
struct k
{
    string k1;
    double k2;
}s[5];
double cmp(k x,k y)
{
    if(x.k2==y.k2)
    return x.k1<y.k1;
    else
    return x.k2<y.k2;
}
double angle(int h,int m)
{
    double a=0;
    int i,j;
    a=fabs(h*30.0+m*0.5-m*6.0);
    if(a>360)
    a-=360.0;
    if(a>180)
    a=360.0-a;
    //cout<<h<<"  "<<m<<"  "<<a<<endl;
    return a;
}
int main()
{
    //freopen("1.txt","r",stdin);
    int i,j,n,e,h,m;
    double an=0;
    map<string,double> w;
    vector<double> q;
    string a;
    cin>>n;
    while(n--)
    {
        e=5;
        while(e--)
        {
            cin>>a;
            h=(a[0]-'0')*10+a[1]-'0';
            m=(a[3]-'0')*10+a[4]-'0';
            s[5-e-1].k1=a;
            s[5-e-1].k2=angle(h,m);
        }
        sort(s,s+5,cmp);
        cout<<s[2].k1<<endl;
    }
    return 0;
}