Devu and Subsequence
Difficulty: Hard

Devu is a newbie to computer programming, so he wants your help in solving a problem. The problem can be described as below:<br>

Given two lists $A$ and $B$ having the same length, find the length of longest subsequence of list $A$, whose sum is greater than or equal to the corresponding subsequence of list $B$. Corresponding subsequence means indices chosen in both of the lists must be the same.

Input Format:
The first line contains an integer $N$, i.e. the length of the lists.<br>
The second line contains $N$ integers corresponding to list $A$.<br>
The second line contains $N$ integers corresponding to list $B$.

**Constraints**  
$1 \le N \le 10^5$<br>
$0 \le A[i] \le  10^7$<br>
$0 \le B[i] \le  10^7$<br>

Output Format:
Print the answer in a single line.

Sample Input:
	3
    100 100 5
    2 2 1000

Sample Output:
	2

Python 3 starter code:


Reference solution (C++):
    #include <cmath>
    #include <cstdio>
    #include <vector>
    #include <iostream>
    #include <algorithm>
    using namespace std;


    int main() {
        int N;
        cin>>N;
        int C[N];
        for(int i = 0 ; i< N ; i++)
            cin>>C[i];
        for(int i = 0 ; i< N ; i++)
        {
                int x;
                cin>>x;
                C[i] = C[i]-x;
        }
        sort(C,C+N);
        long long int s = 0;
        int ans = 0;
        for(int i= N-1 ; i >= 0 ; i--)
        {
                s =  s+ C[i];
                if(s >= 0)
                       ans++;
                else
                        break;
        }
        cout<<ans<<endl;
        return 0;
    }