sicily mid-term practice

#include <iostream>#include <string>#include <cstring>#include <algorithm>#include<stdio.h>using namespace std;int N,M;struct word{    string wor;    int freq;};bool cmp(word a,word b){    return a.freq>b.freq;}int main(){    word wordname[1001];    while (cin>>N>>M)    {        int NN=N;        for(int i=0;i<1001;i++)        {            wordname[i].freq=0;        }        if (N==0&&M==0) break;        int aa=0;        while (N--)        {            int a;            cin>>a;            while (a--)            {                string temp;                cin>>temp;                int i=0;                for (;i<aa;i++)                {                    if (temp==wordname[i].wor)                    {                        wordname[i].freq++;                        break;                    }                }                if(i==aa)                {                    wordname[aa++].wor=temp;                    wordname[i].freq++;                }            }        }        sort(wordname,wordname+aa,cmp);        double sum=0.0;        for(int i=0;i<M;i++)        {            sum+=wordname[i].freq;        }        double outt=sum/NN;        printf("%.2lf\n",outt);      }    return 0;}