class Solution {
public:
int findMin(vector<int>& numbers) {
int n = numbers.size();
if(!n) return -1;
int i = 0;
for(i = 0; i < n; i++){
if(numbers[i] < numbers[n - 1]) break;
}
return numbers[i];
}
};