fsdfd

static int kWeiOfVal(int val, int k)
{
int n = 1;
int temVal = val;
int result;
while (1)
{
temVal = temVal/10;
if (temVal == 0) break;
n++;
}
for (int i = 0; i < n-k; i++)
{
val = val/10;
}
result = val%10;
return result;
}

static bool Comp(int v1, int v2)
{
v1 = kWeiOfVal(v1, 1);
v2 = kWeiOfVal(v2, 1);
return v1 > v2;
}

string solve(vector<int>& nums) {
// write code here
string result;
sort(nums.begin(), nums.end(), Comp);
cout << nums[0] << endl;
return result;
}