Preparation for the computer test of Baosteel 15: a master of string processing

Title Description

https://www.acwing.com/problem/content/3409/

Ideas

There is no algorithm content in this problem , The main Look at grammar
This is a multi-dimensional sorting problem

Code

#include<iostream>
#include<cstring>
#include<algorithm>
#include<sstream>
using namespace std;
const int N=10010;
string logs[N];
int n;
int main()
{
    
    while(getline(cin,logs[n]))
    {
    
        if(logs[n].size()) n++;
        else break;
    }
    // Sort , I have to write the sorting by myself cmp Comparison function 
    sort(logs,logs+n,[](string& a,string& b){
    
        stringstream ssina(a),ssinb(b);
        string sa[4],sb[4];
        
        for(int i=0;i<4;i++) 
        // utilize stringstream Divide the string into spaces 
        {
    
            ssina>>sa[i];
            ssinb>>sb[i];
        }
        // If two computing tasks consume the same time , Then the computing tasks that started earlier will be ranked first . Because the length is fixed , The length of the two compared parts is the same , Therefore, the dictionary order can be directly compared here 
        if(sa[3]==sb[3]) return sa[1]+sa[2]<sb[1]+sb[2];
        
        double da,db;
        // The numbers are different , utilize sscanf Extract floating point number , Let's make another comparison 
        // because sscanf yes C Library function , I won't support it string, All have to pass first .c_str() Convert to character array 
        sscanf(sa[3].c_str(),"%lf(s)",&da);
        sscanf(sb[3].c_str(),"%lf(s)",&db);
        return da<db;
    });
    // Output 
    for(int i=0;i<n;i++)
        cout<<logs[i]<<endl;
    return 0;
}