Kth Smallest Product of Two Sorted Arrays
guys please evaluate this code and let me know is there any bug in this approach \n\n#include <iostream>\nusing namespace std ;\n\nint main() {\n  int nums1[] =
guys please evaluate this code and let me know is there any bug in this approach \n```\n#include <iostream>\nusing namespace std ;\n\nint main() {\n  int nums1[] = {2,5};\n  int nums2[] = {3 , 4 };\n  int n = sizeof(nums1)/sizeof(nums1[0]);\n  int m = sizeof(nums2)/sizeof(nums2[0]);\n\n  int count=0;\n  int k=2;\n  int ans=0;\n\n  for(int i=0; i<n ; i++){\n    for(int j=0; j<m ; j++){\n\n      \n      count++;\n\n      if(count == k){\n        ans = nums1[i] * nums2[j];\n        cout<< ans;\n        \n      }\n      \n\n    }\n  }\n} \n```
['C']