Read the first file and create a hash where the keys will be the concatenation of start and end values, separated by some separator and the value might be the first column of your file if you need it. In the case of your example, this could give this hash:

('200-250' => 1, '310-340' =>2);
[download]

Then you read the second file line by line, build the keys the same way and check if the interval was in the first file. If you find it, output the line to the file of common values, and delete that element from the hash. If not found, output the line to the orphans2 file (file of intervals in the second file but not in the first). At the end of the process, the hash contains the orphans1 (intervals existing in the first file but not in the second).