PAT乙级1064

题目链接

实现

#include <iostream>
#include <string>
#include <algorithm>
using namespace std;


int main()
{
	int N,friendNum=0;
	int count[40] = { 0 };
	string str;
	cin >> N;
	while (N--)
	{
		cin >> str;
		int index = 0;
		for (int i = 0; i < str.size(); i++)
		{
			index += (str[i] - '0');
		}
		
		if (count[index] == 0)
		{
			
			count[index] = index;
			friendNum++;
		}
	}
	sort(count, count + 40);
	cout << friendNum<<endl;
	int maxIndex = distance(count, max_element(count, count + 40));
	for (int j = 0; j < maxIndex; j++)
		if (count[j])
			cout << count[j]<< " ";
	cout << count[maxIndex];
    return 0;
}