sgu 358. Median of Medians 中位数

最新推荐文章于 2024-12-12 16:15:33 发布

原创最新推荐文章于 2024-12-12 16:15:33 发布 · 565 阅读

0 ·

CC 4.0 BY-SA版权

sgu !!!!!!!!!! 同时被 2 个专栏收录

50 篇文章

订阅专栏

水--------------------

24 篇文章

订阅专栏

本文介绍了一个算法挑战，即找出三个三元组各自中位数的中位数。通过阅读本文，读者将了解到如何对每组三元组进行排序以找到各自的中位数，并进一步确定这三个中位数的中位数。

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

358. Median of Medians

Time limit per test: 0.25 second(s)
Memory limit: 65536 kilobytes

input: standard
output: standard

Vasya learned definition of median of three numbers. He says, "Median of three numbers is the number located in the middle when numbers are ordered in non-descending order". Subtle Pete gave him much more difficult task. Vasya has to find median of each of three triples and then find the median of three numbers he found. Please help Vasya with the task.

Input

The input file contains three lines. Each line contains three integers. Each number is not less than -1000 and is not greater than 1000.

Output

Print one number - median of three medians.

Example(s)

sample input	sample output
6 4 5 7 9 8 1 2 3	5

sample input	sample output
1 2 2 4 3 2 2 3 4	3

#include <bits/stdc++.h>

using namespace std;

int a[3],b[3];
void solve(){
    for(int i=0;i<3;i++){
        for(int j=0;j<3;j++){
            scanf("%d",&a[j]);
        }
        sort(a,a+3);
        b[i]=a[1];
    }
    sort(b,b+3);
    printf("%d",b[1]);
}

int main(){
    solve();
    return 0;
}