关于 MLE

#include<bits/stdc++.h>
using std::cin;using std::cout;using std::priority_queue;using std::vector;using std::greater;
int t,n,m,k,a;
int main(){
	std::ios::sync_with_stdio(false);
	cin.tie(nullptr);
	cin>>t;
	while(t--){
		priority_queue<int,vector<int>,greater<int> > pq;
		cin>>n>>m>>k;
		for(int i=1;i<=n;i++){
			cin>>a;
			if(k){
				k--;
				pq.push(a);
			}
			else if(pq.size()&&pq.top()<a){
				m-=pq.top();
				pq.pop();
				pq.push(a);
			}
			else{
				m-=a;
			}
			if(m<=0){
				cout<<i-1<<'\n';
				break;
			}
		}
		if(m>0) cout<<n<<'\n';
	}
	return 0;
}

#include<bits/stdc++.h>
using namespace std;
void solve() {
	long long n,x,k;
	scanf("%lld%lld%lld",&n,&x,&k);
	priority_queue<long long,vector<long long>,greater<long long> > pq;
	int ans=-1;
	for(int i=1; i<=n; i++) {
		long long in;
		scanf("%lld",&in);
		if(k) {
			k--;
			pq.push(in);
		}
		else if(pq.size() && pq.top()<in) {
			x-=pq.top();
			pq.pop();
			pq.push(in);
		}
		else {
			x-=in;
		}
		if(x<=0 && ans==-1) ans=i-1;
	}
	if(ans==-1) ans=n;
	printf("%d\n",ans);
}
int main() {
	int t;
	scanf("%d",&t);
	while(t--) solve();
	return 0;
}