试题编号: | 201903-1 |
试题名称: | 小中大 |
时间限制: | 1.0s |
内存限制: | 512.0MB |
问题描述: | |
///2019-03-01 小中大
#include<iostream>
#include<sstream>
#include<algorithm>
#include<string>
#include<cstring>
#include<iomanip>
#include<vector>
#include<cmath>
#include<ctime>
#include<stack>
#include<queue>
#include<map>
#define mem(a,b) memset(a,b,sizeof(a))
#define e 2.71828182
#define Pi 3.141592654
using namespace std;
int compare(int a, int b)
{
return a > b;
}
int main()
{
int n;
int i, j;
long int num[100000];
double out[3];
scanf("%d", &n);
for (i = 0; i < n; i++)
{
scanf("%ld", &num[i]);
if (i == 0)
out[0] = num[i];
if (i == n - 1)
out[2] = num[i];
if (n % 2 == 0)
{
if (i == n / 2 - 1)
out[1] = num[i];
if (i == n / 2)
out[1] += num[i];
}
else
{
if (i == n / 2)
out[1] = num[i];
}
}
if (n % 2 == 0)
out[1] = out[1] / 2;
sort(out, out + 3, compare);
for (i = 0; i < 3; i++)
{
double temp = out[i];
if (i == 1 && n % 2 == 0 && (temp-(int)temp)!=0)
{
printf("%0.1f", out[i]);
printf(" ");
}
else
{
printf("%0.0f", out[i]);
if (i!=2)
printf(" ");
}
}
return 0;
}