https://www.luogu.com.cn/problem/P9497

#include<bits/stdc++.h>
#define ll long long
using namespace std;
priority_queue<int>p;
priority_queue<int>p2; 
ll n,q,ans;
int a[1111111];
int main(){
	cin>>n>>q;
	for(int i=1;i<=n;i++){
		for(int j=1;j<=n;j++){
			int ii; 
			cin>>ii;
			p.push(ii);
		}
	}int l=1;
	while(l<=q){
		p2=p;
		int w;
		ans=0;
		cin>>w;
		for(int i=1;i<=n;i++){
			if(p2.top()>=w) {
				ans++;
				p2.pop();
			}
		}
		a[l]=ans;		
		l++;
	}
	for(int i=1;i<=q;i++){
		cout<<a[i]<<endl;
	}
	return 0;
}

思路：优先队列把矩阵排序，把最大的取出来和问题一个个比，结果存到数组里，然后把数组的结果输出出来
50分， 以下是记录详情

 Subtask #0
3ms/628.00KB
AC
#1
Accepted, 得分 10.ok accepted
3ms/600.00KB
AC
#2
Accepted, 得分 10.ok accepted
4ms/728.00KB
AC
#3
Accepted, 得分 10.ok accepted
4ms/564.00KB
AC
#4
Accepted, 得分 10.ok accepted
3ms/556.00KB
AC
#5
Accepted, 得分 10.ok accepted
Subtask #1
4ms/572.00KB
AC
#6
Accepted, 得分 40.ok accepted
7ms/552.00KB
AC
#7
Accepted, 得分 40.ok accepted
7ms/552.00KB
AC
#8
Accepted, 得分 40.ok accepted
7ms/556.00KB
AC
#9
Accepted, 得分 40.ok accepted
7ms/560.00KB
AC
#10
Accepted, 得分 40.ok accepted
7ms/580.00KB
AC
#11
Accepted, 得分 40.ok accepted
9ms/552.00KB
AC
#12
Accepted, 得分 40.ok accepted
9ms/556.00KB
AC
#13
Accepted, 得分 40.ok accepted
9ms/564.00KB
AC
#14
Accepted, 得分 40.ok accepted
8ms/556.00KB
AC
#15
Accepted, 得分 40.ok accepted
Subtask #2
404ms/2.22MB
AC
#16
Accepted, 得分 50.ok accepted
1.20s/8.13MB
TLE
#17
Time Limit Exceeded.
1.20s/8.13MB
TLE
#18
Time Limit Exceeded.
1.20s/8.11MB
TLE
#19
Time Limit Exceeded.
1.20s/8.10MB
TLE
#20
Time Limit Exceeded.
1.20s/8.11MB
TLE
#21
Time Limit Exceeded.
1.20s/8.16MB
TLE
#22
Time Limit Exceeded.
1.20s/8.16MB
TLE
#23
Time Limit Exceeded.
1.20s/8.16MB
TLE
#24
Time Limit Exceeded.
1.20s/8.13MB
TLE
#25
Time Limit Exceeded.