HNU 12845 Ballot Analyzing Device

 1 #include<cstdio>
 2 #include<cstring>
 3 #include<iostream>
 4 #include<algorithm>
 5 #include<cstdlib>
 6 using namespace std;
 7 struct node
 8 {
 9     char name[100];
10     double num,ans;
11     int cixu;
12 }men[15];
13 char str[15];
14 bool cmp(node a,node b)
15 {
16     if(a.num == b.num)
17     return a.cixu < b.cixu;
18     return a.num > b.num;
19 }
20 int main()
21 {
22     int n,m;
23     while(scanf("%d%d",&n,&m)!=EOF)
24     {
25             for(int i = 0;i < n;++i)
26             {
27                 scanf("%s",men[i].name);
28                 men[i].num = 0;
29                 men[i].cixu = i;
30             }
31             strcpy(men[n].name,"Invalid");
32             int tt = m;
33             while(tt--)
34             {
35                 scanf("%s",str);
36                 int f = -1;
37                 for(int i = 0;i < n;++i)
38                 if(str[i] == ‘X‘)
39                 {
40                     if(f == -1) f = i;
41                     else f = n;
42                 }
43                 if(f == -1) f = n;
44                 men[f].num++;
45             }
46             for(int i = 0;i <= n;++i)
47             men[i].ans = 100.0 * men[i].num /  (double)m;
48             sort(men,men+n,cmp);
49             for(int i = 0;i <= n;++i)
50             printf("%s %.2lf%%\n",men[i].name,men[i].ans);
51     }
52     return 0;
53 }