Pagini recente » Cod sursa (job #1139256) | Cod sursa (job #629301) | Cod sursa (job #905112) | Cod sursa (job #269209) | Cod sursa (job #1688865)
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("sdo.in");
ofstream g("sdo.out");
void swap(int i,int j, int *a){
int temp = a[i];
a[i] = a[j];
a[j] = temp;
}
void quicksort(int *arr, int left, int right){
int min = (left+right)/2;
int i = left;
int j = right;
int pivot = arr[min];
while(left<j || i<right)
{
while(arr[i]<pivot)
i++;
while(arr[j]>pivot)
j--;
if(i<=j){
swap(i,j,arr);
i++;
j--;
}
else{
if(left<j)
quicksort(arr, left, j);
if(i<right)
quicksort(arr,i,right);
return;
}
}
}
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();
quicksort(b, 0, n);
g << b[2];
g.close();
return 0;
}