git reimport

archive/2019.03/2019.03.11 - Codeforces Round #546 (Div. 2)/TaskA.java

@@ -0,0 +1,29 @@
+package chelper;
+
+import io.InputReader;
+import io.OutputWriter;
+import solutions.ChelperSolution;
+
+
+public class TaskA extends ChelperSolution {
+
+  @Override
+  public void solve(int testNumber, InputReader in, OutputWriter out) {
+    super.solve(testNumber, in, out);
+  }
+
+  @Override
+  public void solve(int testNumber) {
+    int n = in.nextInt();
+
+    int[][] a = in.nextIntIntArray(n, 2);
+
+    int k = in.nextInt();
+
+    for (int i = 0; i < n; i++) {
+      if (a[i][0] <= k && k <= a[i][1]) {
+        out.println(n - i);
+      }
+    }
+  }
+}