杭电oj hdu 1234 开门人和关门人

题目链接：http://acm.hdu.edu.cn/showproblem.php?pid=1234
算法特工队QQ群：979618872 (伸手党绕边，欢迎有良好基础的人加入)

//
// Created by Leo Lee on 2019/4/4.
//

#include <iostream>
#include <vector>
#include <string>
using namespace std;
void findMinandMax(vector<string> v,int& minindex,int &maxindex);
vector<string> id;
vector<string> times;
int main(){
    int cases,subcases;
    cin>>cases;
    while(cases--){
        id.clear();
        times.clear();
        cin>>subcases;
        string tmpin;
        while(subcases--){
            cin>>tmpin;
            id.push_back(tmpin);
            cin>>tmpin;
            times.push_back(tmpin);
            cin>>tmpin;
            times.push_back(tmpin);
        }
        int minindex,maxindex;
        findMinandMax(times,minindex,maxindex);
        cout<<id[minindex/2]<<" "<<id[maxindex/2]<<endl;
    }
    return 0;
}

void findMinandMax(vector<string> v,int& minindex,int &maxindex){
    minindex = maxindex = 0;
    for(int i = 1;i<v.size();i++){
        if (v[i]>v[maxindex]){
            maxindex = i;
        }
        if (v[i]<v[minindex]){
            minindex = i;
        }
    }
}