A. Year of University Entrance

最新推荐文章于 2024-12-21 20:34:09 发布

原创最新推荐文章于 2024-12-21 20:34:09 发布 · 756 阅读

1 ·

CC 4.0 BY-SA版权

ACM的进程同时被 3 个专栏收录

293 篇文章

订阅专栏

ACM竞赛

292 篇文章

订阅专栏

【含有一定思考】

35 篇文章

订阅专栏

通过学生加入的特定社交网络群组来推断该学生的大学入学年份。输入包含学生加入的群组数量及其对应的大学入学年份，输出则是学生的大学入学年份。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

There is the faculty of Computer Science in Berland. In the social net "TheContact!" for each course of this faculty there is the special group whose name equals the year of university entrance of corresponding course of students at the university.

Each of students joins the group of his course and joins all groups for which the year of student's university entrance differs by no more than x from the year of university entrance of this student, where x — some non-negative integer. A value x is not given, but it can be uniquely determined from the available data. Note that students don't join other groups.

You are given the list of groups which the student Igor joined. According to this information you need to determine the year of Igor's university entrance.

Input

The first line contains the positive odd integer n (1 ≤ n ≤ 5) — the number of groups which Igor joined.

The next line contains n distinct integers a1, a2, ..., an (2010 ≤ ai ≤ 2100) — years of student's university entrance for each group in which Igor is the member.

It is guaranteed that the input data is correct and the answer always exists. Groups are given randomly.

Output

Print the year of Igor's university entrance.

Examples

input
3
2014 2016 2015

output
2015

input
1
2050

output
2050

Note

In the first test the value x = 1. Igor entered the university in 2015. So he joined groups members of which are students who entered the university in 2014, 2015 and 2016.

In the second test the value x = 0. Igor entered only the group which corresponds to the year of his university entrance.

思路：

看样例的时候还是一脸懵逼。好吧，我承认我做题少。。。但是吧，我勇敢的猜了一下。

应为n是正奇数，再加上样例和我想的一样，所以就大胆交了一发，A 了。。。

#include<cstdio>
#include<cstring>
#include<cstdlib>
#include<stack>
#include<iostream>
#include<cmath>
#include<algorithm>
using namespace std;
typedef long long LL;
int a[10];
int main()
{
    int n;
    while(~scanf("%d",&n))
    {
        memset(a,0,sizeof(a));
        for(int i=1; i<=n; i++)
            scanf("%d",&a[i]);
        sort(a+1,a+n+1);
        printf("%d\n",a[(1+n)/2]);
    }
}