K个最大数

                                 **    找出前K个最大数   **
                                                          分堆法

完整代码：
import java.util.Scanner;

public class K个最大数1 {

	public static void main(String args[]) {
		
		int i, j, k = 0,l;
		K个最大数1 a2 = new K个最大数1();
		Scanner b = new Scanner(System.in);
		int f, e, c;
		float g;
		System.out.println("如果你想手动输入数字扣1，随机产生扣2");
		l=b.nextInt();
		System.out.println("输入你想输入几个数字");
		c = b.nextInt();
		//System.out.println("输入你想输入的数字");
		int c1[] = new int[c];
		if(l==1)
		{System.out.println("输入你想输入的数字");
		for (i = 0; i < c; i++) {
			c1[i] = b.nextInt();
		}}
		else 
		for (i = 0; i < c; i++) {
			c1[i] = (int)(Math.random()*100);
			//System.out.printf("%-5d",c1[i]);
		}
		System.out.println("\n");
		System.out.println("输入你想找到前几个最大数");
		f = b.nextInt();
		if( c%f ==0 ) {
			e = c / f;
		}
		else {
			e = c / f + 1;
		}
		int b1[] = new int[f];
		int c2[] = new int[f];
		int a[][] = new int[f][e];
		
		System.out.println("\n");
		for (i = 0; i < f && k != c; i++) {
			for (j = 0; j < e && k != c; j++) {
				a[i][j] = c1[k];
				System.out.printf("%02d     ",c1[k++]);
			}
			System.out.printf("\n\n");
		}
		c2 = a2.K个最大数实现过程(f, e, b1, a);
		for (i = 0; i < f; i++)
			System.out.println(c2[i]);
	}
	public int[] K个最大数实现过程(int f, int e, int b[], int a[][]) {
		int maxrow[] = new int[f];
		int maxcolumn[] = new int[f];
		int flag = -100, i, j = 0, k = 0, m, n, maxrow1 = 0, maxcolumn1 = 0, flag1 = 0, l = 0;
		for (i = 0; i < f; i++) {
			for (j = 0; j < f; j++) {
				
				if (flag != -100)
					j = maxrow1;
				
				maxrow[j] = j;
				maxcolumn[j]=0;
				m = a[j][0];
				
				for (k = 1; k < e; k++)
					if (m < a[j][k]) {
						m = a[j][k];
						maxcolumn[j] = k;
					}
				
				if (flag != -100)
					break;
				
			}
			n = a[0][maxcolumn[0]];
			//n = 0;
			maxrow1 = 0;
			maxcolumn1 = 0;	
			for (l = 1; l < f; l++)
				
				if (n < a[l][maxcolumn[l]]) {
					
					n = a[l][maxcolumn[l]];
					maxrow1 = l;
					//maxcolumn1 = maxcolumn[l];
				}
					flag = maxrow1;
			b[i] = a[maxrow1][maxcolumn[maxrow1]];
			a[maxrow1][maxcolumn[maxrow1]] = -100;
			//b[i] = a[maxrow1][maxcolumn1];
			//a[maxrow1][maxcolumn1] = -100;
		}
		return b;
	}
}