题目1431：Sort

题目描述：

给你n个整数，请按从大到小的顺序输出其中前m大的数。

输入：

每组测试数据有两行，第一行有两个数n,m(0<n,m<1000000)，第二行包含n个各不相同，且都处于区间[-500000,500000]的整数。

输出：

对每组测试数据按从大到小的顺序输出前m大的数。

样例输入：

5 3
3 -35 92 213 -644

样例输出：

213 92 3

#include <cstdio>
#include <queue>
#include <vector>
#include <functional>

using namespace std;

int main()
{
    int n, m;

#ifndef ONLINE_JUDGE
    freopen("d:\\OJ\\uva_in.txt", "r", stdin);
#endif

    while (scanf("%d%d", &n, &m) == 2) {
        priority_queue<int, vector<int>, greater<int> > pq;

        for (int i = 0; i < n; i++) {
            int num;
            scanf("%d", &num);
            if (pq.size() < m) {
                pq.push(num);
            } else if (num > pq.top()) {
                pq.pop();
                pq.push(num);
            }
        }

        vector<int> v;
        while (!pq.empty()) {
            int num = pq.top(); pq.pop();
            v.push_back(num);
        }

        printf("%d", v[v.size() - 1]);
        for (int i = v.size() - 2; i >= 0; i--) {
            printf(" %d", v[i]);
        }
        printf("\n");

    }
    return 0;
}

import java.io.FileReader;
import java.io.InputStreamReader;
import java.io.IOException;
import java.io.BufferedReader;
import java.util.Scanner;
import java.util.PriorityQueue;
import java.util.Comparator;
import java.util.Stack;

class Main
{
	public static final boolean DEBUG = false;
	
	public static void main(String[] args) throws IOException
	{
		Scanner cin;
		int n, m;
		
		if (DEBUG) {
			cin = new Scanner(new FileReader("d:\\OJ\\uva_in.txt"));
		} else {
			cin = new Scanner(new InputStreamReader(System.in));
		}
		
		while (cin.hasNext()) {
			n = cin.nextInt();
			m = cin.nextInt();
			PriorityQueue<Integer> pq = new PriorityQueue<Integer>();
			
			for (int i = 0; i < n; i++) {
				int num = cin.nextInt();
				if (pq.size() < m) {
					pq.add(num);
				} else {
					if (num > pq.peek()) {
						pq.poll();
						pq.add(num);
					}
				}
			}
			
			int[] ans = new int[pq.size()];
			int cnt = 0;
			while (!pq.isEmpty()) {
				ans[cnt++] = pq.poll().intValue();
			}
			
			System.out.print(ans[cnt - 1]);
			for (int i = cnt - 2; i >= 0; i--) {
				System.out.print(" " + ans[i]);
			}
			System.out.println();
		}
	}
}