uva-10602-贪心

 
#include <string>
#include<iostream>
#include<map>
#include<memory.h>
#include<vector>
#include<algorithm>
#include<queue>
#include<vector>
#include<stack>
#include<math.h>
#include<iomanip>
#include<bitset>
#include"math.h"
namespace cc
{
    using std::cout;
    using std::endl;
    using std::cin;
    using std::map;
    using std::vector;
    using std::string;
    using std::sort;
    using std::priority_queue;
    using std::greater;
    using std::vector;
    using std::swap;
    using std::stack;
    using std::bitset;



    constexpr int N = 110;

    int cases;
    char strs[N][N];
    char cur[N];
    
    int total = 0;
    int n;

    void solve()
    {
        cin >> cases;
        while (cases--) 
        {
            cin >> n;
            total = 0;
            memset(strs,0,sizeof(strs));
            for (int i=0;i<n;i++) 
            {
                scanf("%s",strs[i]);
            }
            total += strlen(strs[0]);
            memcpy(cur,strs[0],sizeof(strs[0]));
            int vis[N] = {0};
            int seqs[N] = {0};
            int seq = 0;
            seqs[seq++] = 0;
            vis[0] = 1;
            while (true) 
            {
                int nextIndex = -1;
                int min = -1;
                int curL = strlen(cur);
                for (int i=0;i<n;i++) 
                {
                    if (vis[i] != 0)
                        continue;
                    int curMin = 0;
                    for (int j=0;j< curL;j++)
                    {
                        if (strs[i][j] == ‘\0‘|| strs[i][j]!= cur[j])
                            break;
                        ++curMin;
                    }
                    if (min < curMin)
                    {
                        min = curMin;
                        nextIndex = i;
                    }
                }
                if (nextIndex == -1)
                    break;
                vis[nextIndex] = 1;
                seqs[seq++] = nextIndex;
                total += strlen(strs[nextIndex])-min;
                memcpy(cur,strs[nextIndex],N);
            }
            cout << total << endl;
            for (int i = 0;i < n;i++)
            {
                cout << strs[seqs[i]] << endl;
            }
            
            
        }
    }

};


int main()
{

#ifndef ONLINE_JUDGE
    freopen("d://1.text", "r", stdin);
#endif // !ONLINE_JUDGE
    cc::solve();

    return 0;
}