Lemonade Line

题目

• Problem Description
  It’s a hot summer day out on the farm, and Farmer John is serving lemonade to his N cows! All N cows (conveniently numbered 1…N) like lemonade, but some of them like it more than others. In particular, cow i is willing to wait in a line behind at most wiwi cows to get her lemonade. Right now all N cows are in the fields, but as soon as Farmer John rings his cowbell, the cows will immediately descend upon FJ’s lemonade stand. They will all arrive before he starts serving lemonade, but no two cows will arrive at the same time. Furthermore, when cow i arrives, she will join the line if and only if there are at most w_i cows already in line.

  Farmer John wants to prepare some amount of lemonade in advance, but he does not want to be wasteful. The number of cows who join the line might depend on the order in which they arrive. Help him find the minimum possible number of cows who join the line.

• Input
  The first line contains N, and the second line contains the N space-separated integers w₁,w₂,…,w_N. It is guaranteed that 1≤N≤10⁵, and that 0≤w_i≤10⁹ for each cow i.

• Output
  Print the minimum possible number of cows who might join the line, among all possible orders in which the cows might arrive.

• input
  5
  7 1 400 2 2

• output
  3

题意

每头牛都有一个可以忍受多长队伍的属性，超过忍受长度则牛就不会进队列
求出最短队伍长度

思路

将容忍度高的牛放前面，后面容忍度小的牛就不会入列了
贪心，每次都将容忍度最高的牛入队

代码

#include <bits/stdc++.h>
using namespace std;

int main(){
	int cow[100100];
	int N;
	scanf("%d",&N);
	for(int i=1;i<=N;++i){
		scanf("%d",cow+i);
	}
	sort(cow+1,cow+1+N);

	int queue=0;
	for(int i=N;i>0;--i){
		if(cow[i]>=queue)
			queue++;
		else break;
	}
	printf("%d\n",queue);
	
	return 0;
}