747
数组
寻找最小的两个数
#include <cstdio>
#include <iostream>
#include <set>
#include <vector>
using namespace std;
int dominantIndex(vector<int>& nums)
{
int maxn = -1;
int maxnsec = -1;
int maxnid = -1;
for (int i = 0; i < nums.size(); ++i)
{
if (nums[i] > maxn)
{
maxnsec = maxn;
maxn = nums[i];
maxnid = i;
}
else if (nums[i] > maxnsec)
{
maxnsec = nums[i];
}
}
if (maxnsec*2 > maxn)
{
return -1;
}
else
{
return maxnid;
}
}
int main()
{
vector<int> a;
int x;
for(int i=0;i<4;i++)
{
cin>>x;
a.push_back(x);
}
/*for ( int ix = 0; ix < a.size(); ++ix )
cout << a[ ix ] <<endl;*/
cout<<dominantIndex(a)<<endl;
return 0 ;
}