HANAUOJ JAVA T1157

HANAUOJ JAVA T1157

import java.util.Scanner;

public class H1157 {
	//计算“+”个数
	public static int count(char [][] ch) {
		int count=0;
		for(char[] cells :ch ) {
			for(char cell :cells)
				if(cell=='+')
					count++;
		}
		return count;
	}
	//储存每个字符数组
	public static String string(char[][] ch) {
		String s = "" ;
		for(char[] cells :ch) {
			for(char cell: cells)
				s+=cell;
			s+="\n";
		}
		return s;
	}
	public static void main(String[] args) {
		// TODO Auto-generated method stub
		Scanner in =new Scanner(System.in);
		int n=in.nextInt();
		int a=in.nextInt();
		int b=in.nextInt();
		int[] arr=new int [n];
		String[] s1=new String[n];
		//读入字符数组
		for(int z=0;z<n;z++) {
			char[][] ch=new char[a][b];
			for(int i=0;i<a;i++) {
				String s=in.next();
				ch[i]=s.toCharArray();
			}
			arr[z]=count(ch);
			s1[z]=string(ch);
		}
		//进行大小排序
		for(int j=0;j<arr.length-1;j++) {
			for(int i=0;i<arr.length-j-1;i++)
				if(arr[i]>arr[i+1]) {
					int k=arr[i];
					arr[i]=arr[i+1];
					arr[i+1]=k;
					String t=s1[i];
					s1[i]=s1[i+1];
					s1[i+1]=t;
				}
		}
		//输出
		for(int i=0;i<s1.length;i++) {
			
			System.out.print(s1[i]);;
		}
		in.close();
		

	}

}