Pagini recente » Cod sursa (job #404180) | Cod sursa (job #1587209) | Cod sursa (job #1311173) | Cod sursa (job #404266) | Cod sursa (job #1688858)
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("sdo.in");
ofstream g("sdo.out");
int main()
{
int n, a; f >> n >> a;
int b[n];
f >> b[0];
for(int i = 1; i < n; i++){
f >> b[i];
if(b[i-1] > b[i]){
int aux = b[i-1];
b[i-1] = b[i];
b[i] = aux;
}
}
f.close();
int swp = 1;
while(swp){
swp = 0;
for(int i = 1; i < n; i++){
if(b[i-1] > b[i])
{
int aux = b[i-1];
b[i-1] = b[i];
b[i] = aux;
swp = 1;
}
}
}
g << b[2];
g.close();
return 0;
}