Submission #39866777

---

Source Code Expand

using System;
using System.Text;
using System.Collections.Generic;

class Program
{
  	static int biSearch(int value,int[] array){
      int ans = -1;
      int left = 0;
      int right = array.Length - 1;
      while(left <= right){
      	int mid = (left + right) / 2;
        if(array[mid] == value){
          ans = mid;
          break;
        }else if(array[mid] > value){
          right = mid - 1; 
        }else if(array[mid] < value){
          left = mid + 1;
        }
      }
      return ans;
    }
  
 	static void Main(string[]  args){
      var nm = Console.ReadLine().Split();
      int n = Int32.Parse(nm[0]);
      int m = Int32.Parse(nm[1]);
      var astr = Console.ReadLine().Split();
      var bstr = Console.ReadLine().Split();
      int[] a = new int[n];
      int[] b = new int[m];
      int[] c = new int[n + m];
      for(int i = 0;i < n;++i){
        a[i] = Int32.Parse(astr[i]);
      }
      for(int i = 0;i < m;++i){
        b[i] = Int32.Parse(bstr[i]);
      }
      for(int i = 0;i < n + m;++i){
        if(i < n){
          c[i] = a[i];
        }else{
          c[i] = b[i - n];
        }
      }
      Array.Sort(c);
      for(int i = 0;i < n;++i){
         if(i != 0){
           Console.Write(" ");
         }
        int ans = biSearch(a[i],c);
        Console.Write(ans + 1);
      }
      Console.WriteLine();
      
      for(int i = 0;i < m;++i){
         if(i != 0){
           Console.Write(" ");
         }
        int ans = biSearch(b[i],c);
        Console.Write(ans + 1);
      }
      Console.WriteLine();
    }
}

Submission Info

Judge Result