Algorithms: Sorting Problems

Author: OmkarPathak

CompetitiveProgramming/HackerEarth/Algorithms/Sorting/P01_SavePatients.py

@@ -0,0 +1,42 @@
+# Bubble Sort Problem
+#
+# A new deadly virus has infected large population of a planet. A brilliant scientist has discovered a new strain of
+# virus which can cure this disease. Vaccine produced from this virus has various strength depending on midichlorians
+# count. A person is cured only if midichlorians count in vaccine batch is more than midichlorians count of person. A
+# doctor receives a new set of report which contains midichlorians count of each infected patient, Practo stores all
+# vaccine doctor has and their midichlorians count. You need to determine if doctor can save all patients with the
+# vaccines he has. The number of vaccines and patients are equal.
+#
+# Input Format
+#
+# First line contains the number of vaccines - N. Second line contains N integers, which are strength of vaccines.
+# Third line contains N integers, which are midichlorians count of patients.
+#
+# Output Format
+#
+# Print a single line containing ′Yes′ or ′No′.
+#
+# Input Constraint
+# 1<N<10
+# Strength of vaccines and midichlorians count of patients fit in integer.
+#
+# SAMPLE INPUT
+# 5
+# 123 146 454 542 456
+# 100 328 248 689 200
+#
+# SAMPLE OUTPUT
+# No
+
+n = int(input())
+vaccine = [int(i) for i in input().split()]
+patient = [int(i) for i in input().split()]
+count = 0
+for i in range(n):
+    if vaccine[i] < patient[i]:
+        count += 1
+
+if count > 0:
+    print('No')
+else:
+    print('Yes')