摘要:水,排序
#include <iostream>
#include <stdio.h>
#include <string>
#include <iomanip>
#include <algorithm>
using namespace std;
const int size = 1000000;
string input[size];
int main()
{
char tree[50];
int index = 0;
while(fgets(tree, 45, stdin)){
//string temp = tree;
//temp = temp.substr(0, temp.length()-1);
input[index++] = tree;
}
sort(input, input+index);
double total = index;
int pre_pos = 0;
for(int i=0; i<index; i++){
if(input[i] != input[pre_pos]){
printf("%s %.4f/n", input[pre_pos].substr(0, input[pre_pos].length()-1).c_str(), 100 * (i-pre_pos)/total);
pre_pos = i;
}
}
printf("%s %.4f/n", input[pre_pos].substr(0, input[pre_pos].length()-1).c_str(), 100 * (index-pre_pos)/total);
return 0;
}