# PTA-数据结构 5-24 树种统计 (25分)

29
Red Alder
Ash
Aspen
Basswood
Ash
Beech
Yellow Birch
Ash
Cherry
Cottonwood
Ash
Cypress
Red Elm
Gum
Hackberry
White Oak
Hickory
Pecan
Hard Maple
White Oak
Soft Maple
Red Oak
Red Oak
White Oak
Poplan
Sassafras
Sycamore
Black Walnut
Willow

### 输出样例:

Ash 13.7931%
Aspen 3.4483%
Basswood 3.4483%
Beech 3.4483%
Black Walnut 3.4483%
Cherry 3.4483%
Cottonwood 3.4483%
Cypress 3.4483%
Gum 3.4483%
Hackberry 3.4483%
Hard Maple 3.4483%
Hickory 3.4483%
Pecan 3.4483%
Poplan 3.4483%
Red Alder 3.4483%
Red Elm 3.4483%
Red Oak 6.8966%
Sassafras 3.4483%
Soft Maple 3.4483%
Sycamore 3.4483%
White Oak 10.3448%
Willow 3.4483%
Yellow Birch 3.4483%

#include <iostream>
#include <string>
#include <map>
#include <algorithm>

#define MAX 100000 + 10

using namespace std;

typedef struct {
string name;
int num;
} Tree;

Tree tree[MAX];

int member = 1;
map<string, int> mp;

void findTree( string name ) {
if( mp[name] == 0 ) {
mp[name] = member;

tree[member].name = name;
tree[member].num++;

member++;
}
else {
int id = mp[name];
tree[id].num++;
}

}

int cmp( Tree a, Tree b ) {
return a.name < b.name ? 1 : 0;
}

int main() {
//freopen( "123.txt", "r", stdin );
int n;
scanf( "%d", &n );
char ch = getchar();
string name;
for( int i = 0; i < n; i++ ) {
getline( cin, name );
findTree( name );
}

sort( tree + 1, tree + member, cmp );

for( int i = 1; i < member; i++ ) {
printf( "%s %.4lf%%\n", tree[i].name.c_str(), (double)tree[i].num * 100.0 / n );
}

return 0;
}

• 广告
• 抄袭
• 版权
• 政治
• 色情
• 无意义
• 其他

120