文章
5
粉丝
0
获赞
0
访问
360
#include<iostream>
#include<algorithm>
#include<string>
#include<vector>
using namespace std;
struct ji{string num;
string lai;
string zou;};
bool cmp1(const ji&a,const ji&b){
if(a.lai.substr(0,2)!=b.lai.substr(0,2)){return stoi(a.lai.substr(0,2))<stoi(b.lai.substr(0,2));}
else if(a.lai.substr(3,2)!=b.lai.substr(3,2)){return stoi(a.lai.substr(3,2))<stoi(b.lai.substr(3,2));}
return stoi(a.lai.substr(6,2))<stoi(b.lai.substr(6,2));}开门最早
bool cmp2(const ji&a,const ji&b){
if(a.zou.substr(0,2)!=b.zou.substr(0,2)){return stoi(a.zou.substr(0,2))>stoi(b.zou.substr(0,2));}
else if(a.zou.substr(3,2)!=b.zou.substr(3,2)){return stoi(a.zou.substr(3,2))>stoi(b.zou.substr(3,2));}
return stoi(a.zou.substr(6,2))>stoi(b.zou.substr(6,2));}关门最晚
int main(){int m;
cin>>m;
...
登录后发布评论
暂无评论,来抢沙发