简单错误记录

文件路径为windows格式

如：E:\V1R2\product\fpgadrive.c 1325

结果根据数目从多到少排序，数目相同的情况下，按照输入第一次出现顺序排序。

如果超过8条记录，则只输出前8条记录.

如果文件名的长度超过16个字符，则只输出后16个字符

#include<iostream>  
#include<string>  
#include<vector>  
#include<map>  
#include<algorithm>  
using namespace std;  
struct ErrorLog  
{  
    string name;  
    int line; //最好写成int型  
    int count;  
};  
ErrorLog CreateErrorLog(string name, int line)  
{  
    ErrorLog log;  
    int nameSize = name.length();  
    int index = -1;  
    for (int i = nameSize - 1; i >= 0; --i)  
    {  
        if (name[i] == '\\') //注意！  
        {  
            index = i;  
            break;  
        }  
    }  
    name = name.substr(index + 1);  
    log.name = name;  
    log.line = line;  
    log.count = 1;  
    return log;  
}  
void RecordErrorLog(int number, ErrorLog log, vector<ErrorLog>& res)  
{  
    bool isrepeat = false;  
    for (int i = 0; i < res.size(); ++i)  
    {  
        if (res[i].name == log.name && res[i].line == log.line)  
        {  
            res[i].count++;  
            isrepeat = true;  
            break;  
        }  
    }  
    if (isrepeat == false)  
    {  
        //if (res.size() < 8)  
        //{  
            res.push_back(log);  
        //}  

    }  
}  
static bool Compare(const ErrorLog& a, const ErrorLog& b)  
{  
    return a.count>b.count;  
}  
int main()  
{  
    string name;  
    int line;  
    vector<ErrorLog> result;  

    int number = 8;  
    while (cin>>name>>line)  
    {  
        ErrorLog log = CreateErrorLog(name, line);  
        RecordErrorLog(number, log, result);  
    }  
    sort(result.begin(), result.end(),Compare);//升序排序  
    for (int i = 0; i < 8; ++i)  
    {  
        int len = result[i].name.length();  
        if (len>16)  
            result[i].name = result[i].name.substr(len - 16);  
        cout << result[i].name << " " << result[i].line << " " << result[i].count << endl;  
    }     
}