Source Code
#include <iostream>
#include <algorithm>
using namespace std;
int n,s;
int main() {
	cin>>n>>s;
	int t[n],r[n],a[n],b=0;
	for(int i=0;i<n;i++){
		cin>>t[i];
	}
	for(int i=0;i<n;i++){
		cin>>r[i];
		a[i]=r[i]-t[i];
	}
	sort(a,a+n);
	for(int i=n-1;i>=0;i--){
		s+=a[i];
		if(s<=0){
			b++;
		}
	}
	cout<<n-b+1;
	return 0;
}
Copy
Wheatly's portals - Easy version a.h
GNU G++17
3 ms
400 KB
Wrong Answer