1) #171 PrimaCifraMinima:
#include <iostream>
using namespace std;
int main() {
int n, a, nn, p, m, min = 9, sol = 0;
cin >> n;
for(int i = 0; i < n; i++) {
cin >> a;
nn = a;
while (nn > 9)
nn = nn /10;
if (min > nn) {
min = nn;
sol = a ;
}
if (min == nn) {
if (sol < a)
sol = a;
}
}
cout << sol;
return 0;
}
2) #172 difMin :
#include <iostream>
using namespace std;
int main() {
int n, a, b, sol1, sol2, min = 1000000000;
cin >> n;
cin >> a;
for (int i = 1 ; i < n; i++) {
cin >> b;
int dif = a - b;
if (dif < 0)
dif = -1 * dif;
if(min > dif){
sol1 = a;
sol2 = b;
min = dif;
}
a = b;
}
cout << sol1 << " " << sol2;
return 0;
}