Anagram Groups(字符串)

http://acm.sdut.edu.cn/sdutoj/problem.php?action=showproblem&problemid=2316

理解错一点题意就能WA到死。。。题中对于重复的单词，只输出一个，但是重复的单词个数要加上

#include <stdio.h>
#include <string.h>
#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <map>
using namespace std;
const int N=100010;
int vis[N];
vector<string>v[N];
map<string,int>mp;
struct node
{
    int Size;
    int num;
    friend bool operator < (node a,node b)
    {
        if (a.Size == b.Size)
        {
            return v[a.num][0] < v[b.num][0];
        }
        return a.Size > b.Size;
    }
} G[N];
int main()
{
    string s[N],s2[N];
    char ss[N];
    int  i = 0;
    mp.clear();
    while(scanf("%s",ss)!=EOF)
    {
        if(ss[0]=='0')
            break;
        mp[ss]++;
        if(mp[ss]==1)
        {
            s[i] = ss;
            sort(ss,ss+strlen(ss));
            s2[i++] = ss;
        }
    }
    int n = i;
    int p = 0;
    memset(vis,0,sizeof(vis));
    for (int j = 0; j < n; j++)
    {
        if (vis[j])
            continue;
        int Size = 0;
        for (int k = j; k < n; k++)
        {
            if (s2[j]==s2[k])
            {
                vis[k] = 1;
                v[p].push_back(s[k]);
                if(mp[s[k]]>1)
                    Size+=mp[s[k]]-1;
            }
        }
        G[p].Size = v[p].size()+Size;
        G[p].num = p;
        sort(v[p].begin(),v[p].end());
        p++;
    }
    sort(G,G+p);
    if (p > 5)
        p = 5;
    for (int j = 0; j < p; j++)
    {
        printf("Group of size %d:",G[j].Size);
        for (int k = 0; k < v[G[j].num].size(); k++)
        {
            cout<<" "<<v[G[j].num][k];
        }
        printf(" .
");
    }
    return 0;
}