找出旋转有序数列的中间值

#include <iostream>
#include <vector>
#include <algorithm>
#include <cstdio>
using namespace std;
vector<int> nums;
int main(){
	char c;
	int x;
	while(scanf("%d", &x) != EOF){
		c = getchar(); 
		nums.push_back(x);
		if(c == ';') break;
	}
	int l = 0, r = nums.size() - 1;
	while(l < r){
		int mid = l + r >> 1;
		if(nums[mid] <= nums.back()) r = mid;
		else l = mid + 1;
	}
	int t = nums.size();
	r = t - l;
	if(r >= t/2+1) 
		cout << nums[l + t/2] << endl;
	else 
		cout << nums[t/2-r] << endl; 
	return 0;
}