PAT甲级 1029 Median

墨衍会员 · AI 创作全网分发 墨衍智能分发 本文由作者通过墨衍一键同步至各平台 1分发平台 800+累计阅读 810平均单平台已同步平台优快云微信公众号微博知乎掘金百家号博客园抖音小红书 你的文章也可以这样分发 墨衍会员 ¥399起/年，写一次发全网我也要 → 码龄8年

关注

原创最新推荐文章于 2026-01-19 21:42:16 发布 810 阅读 AI 写同款· GEO 优化 ›

手把手教你用UM982搭建厘米级RTK定位系统（附避坑指南）本文详细介绍了如何使用UM982模组搭建厘米级RTK定位系统，涵盖硬件连接、软件配置和深度优化技巧。UM982支持BDS、GPS、GLONASS和Galileo等多系统全频点信号，特别适合精准农业、无人机导航等高精度应用场景。通过实战案例和避坑指南，帮助开发者快速实现厘米级定位精度。阅读详情

1029 Median

题目大意：给出两个列表，先将它们合并，然后从小到大排序，输出中位数

思路：简单的模拟。注意列表长度为偶数时输出的是n/2-1位置处的点，还有我并不知道这题可不可以重复，反正我是去重后AC的。

l1=list(map(int,input().split()))
l2=list(map(int,input().split()))
n1,n2=l1[0],l2[0]
n=n1+n2
l1,l2=l1[1:],l2[1:]
l1.extend(l2)
l1=list(set(l1))
l1.sort()
if n%2==1:  #n为奇数
    print(l1[int(n/2)])
else:   #n为偶数
    print(l1[int(n/2)-1])

收录于

PAT

当前文章被收录于：

PAT

68 篇文章 1 人学习

订阅专栏查看详情

当前文章被以下社区和专栏收录：

标签

#python

LTE网络下的SMS收发(SMS Over SGs方案的详细流程）关键词: IMS,SMS, LTE, MSC, MME, EPS,eNodeB, SMS Over SGs, SMS Over IMS 2G时代由于采用了比较复杂的CS/PS域架构，所以SMS(短信)作为上个世纪的产物，一直寄居在2G的CS域架构下。看看核心网的配置，其实SMS的收发还是比较复杂的。介绍下面的信息之前你需要去百度一下这些关键词，这里我只说明比较重要的三个单元 MS 移动终端... 阅读详情

相关推荐

Dify-前端本地运行-单点登录

本文介绍了如何在已部署Dify的系统中实现AI应用跳转及页面定制化改造。通过iframe跳转无法满足甲方需求后，作者对Dify前端源码进行了本地化二次开发，主要步骤包括：1) 按照官方文档搭建本地开发环境；2) 修改.env配置文件连接部署好的后端服务；3) 隐藏侧边栏和头部导航栏；4) 实现单点登录功能，通过URL参数获取用户邮箱自动登录。过程中解决了请求拦截导致的登录校验问题，最终达成仅保留对话框界面并同步用户信息的需求。该方案涉及Next.js框架和React技术的应用，为类似定制化需求提供了参

weixin_43163457的博客 3224

[PAT甲级]1029. 取中位数

PAT甲级真题1029，有点小坑的排序题

hzykirito的博客 266

快速入门：使用 SQL Server Management Studio (SSMS) 连接和查询 SQL Server 实例

开始使用 SQL Server Management Studio (SSMS) 连接到 SQL Server 实例并运行一些 Transact-SQL (T-SQL) 命令。本文介绍如何连接和查询实例SQL Server。有关 Azure SQL，请参阅连接。若要使用，请参阅连接和查询。若要详细了解如何SQL Server Management Studio，请参阅其他。......

m0_72938729的博客 5729

PAT甲级 1029 Median(25) (STL)

NHS6671的博客 213

PCI Express 权威指南：从协议原理到芯片实现

目录全文总览第一部分：PCIe体系结构概览第1章互连技术的演进与PCIe的诞生1.1 从ISA到PCI：并行总线的辉煌与瓶颈1.2 PCI-X的尝试与局限1.3 串行革命：从AGP、PCI到PCIe的范式转移1.4 PCIe的核心优势第2章 PCIe系统全局视角2.1 系统拓扑：Root Complex, Switch, Endpoint的职能与关系2.2 拓扑结构实例：服务器、工作站、嵌入式系统2.3 枚举与配置：系统如何发现和组织PCIe设备2.4 地址空间第3章 PCIe协议分层架构3.1 分层模

qq_42882296的博客 2893

主板USB接口全部失效解决方案（通用串行总线USB控制器有黄色叹号）保姆级教程亲测有效

通用串行总线控制器总是有叹号解决办法办公室的崩腾时代老电脑，疫情期间没人用，来了开机之后发现鼠标键盘都用不了，本以为是主机放时间长出了问题，后来想起来就百度了“鼠标键盘都失效”的标题，结果发现了“串行总线控制器总是感叹号”的关联问题。正好办公室电脑都装有teamviwer常用来远程办公(在家偷懒)。所以通过远程发现电脑室可以运行的。并在控制面板发现:通用串行总线控制器总是感叹号,插入外设时USB无反应。如图：并且右键选中其中一个，点击最后一个选项：“属性” 可以发现“设备状态”中会提示“由...

xiao_bai_0_0的博客 2万+

【PAT甲级 - C++题解】1029 Median

📣专栏定位：为想考甲级PAT的小伙伴整理常考算法题解，祝大家都能取得满分！

Newin2020的博客 549

Python 爬虫实战：抓取悦动圈跑步爱好者运动轨迹数据，规划健身路线

通过本次 Python 爬虫实战，我们学习了如何使用 Python 抓取悦动圈跑步爱好者的运动轨迹数据，并基于这些数据进行分析和处理，最终规划出健身路线。在这个过程中，我们掌握了requests、BeautifulSoup、pandas和matplotlib等库的基本使用方法，了解了爬虫的基本原理和流程。希望本文能够帮助你更好地理解和应用 Python 爬虫技术，在数据处理和分析领域取得更多的成果。

u014481728的博客 2363

爆刷PAT（甲级）——之【1029】 Median（25 分）——队列问题+内存优化

PS:如果你看完了下面的内容，那很不幸，很多都是没必要的。。。因为我才发现，long int 就是int ！（可恶也就是说下面关于内存的什么long long 好像都是我YY出来的，因为数据类型题目已经保证了是int ...... 惭愧惭愧，博客也懒得改了，以下为原答案：题意：给两个有序序列，输出两个序列合并以后的中位数。难点：我很惭愧，这题没有用到高深的算法，没有用到优秀的数据结构，...

Hide_in_Code 1345

AI智能体丨使用Coze生成自媒体短视频分镜生成器（附保姆级教程）

【短视频分镜脚本生成器】是一款由Coze平台开发出来的智能体，可快速解析某音/某书视频或本地文件，自动生成专业分镜脚本。用户只需输入视频链接或上传文件，系统即会分析镜头节奏、叙事逻辑和画面内容，输出包含画面、模板和话术参考的标准化脚本（支持3分钟内视频）。该工具还能生成HTML网页和可下载图片，提供可视化呈现。工作流程包括视频解析、帧提取、AI画面理解、脚本生成和网页制作，大幅提升短视频创作效率。

李同学Lino的博客 1534

人群仿真软件：AnyLogic_（12）.AnyLogic高级功能应用

在AnyLogic中，自定义行人行为是通过编写Java代码来实现的。行人行为的自定义可以包括行走路径的选择、速度变化、交互行为等。这使得仿真模型更加灵活和真实。

kkchenjj的博客 1060

PAT 甲级 1029 Median (25分)

Note 双指针注意程序中的index++！！若是按照index++，则可能出现，index=3，target=4，index!=target 不会break；但是继续执行index++后，index=target，那么就会影响到退出while后的if-else！！所以改为**++index**，相应的target也要+1。 Code: #include<bits/stdc++.h> using namespace std; int main(){ #ifndef ONLINE_JUD

HHCCCaptain的博客 195

PD3.0详解第六章协议层—数据消息之—VDM

PD3.0的VDM 很多对PD3.0协议了解不是很深入的同学可能对VDM有一些陌生，因为这个VDM是较为次要，只不过相对沟通电源的协议来讲VDM是次要，但从PD3.0协议的角度来说，这个也是非常重要的，是必须要非常明白的了解这个东西，所以今天大师匈就分享一下这部分的重要知识点。 VDM (vendor define message) VDM是什么意思呢，就是原厂定义的消息，比如PD快充芯片的原厂定义的一些自己独立的message。但是呢这部分也有规定的一些标准的字段。另外我们要很清楚PD协议的数据分为几类

大师匈的博客 1万+

Day58: [PAT甲级] 1029 Median (25分)

Day58: [PAT甲级] 1029 Median (25分) 题源：来自PAT真题库： https://pintia.cn/problem-sets/994805342720868352/problems/994805466364755968 代码： dirty code凑合看吧 #include<iostream> #include<string> #includ...

qq2215459786的博客 212

RU DOS版、EFI版32bit/64bit BIOS常用工具

DOS版、EFI版的RU工具，可用来查看IO、MEM、PCI、SMBIOS等资源。亲测在EFI SHELL下可用。

深度学习工具包 DeepLearningToolbox

深度学习工具包Deprecation notice.-----This toolbox is outdated and no longer maintained.There are much better tools available for deep learning than this toolbox, e.g. [Theano](http://deeplearning.net/software/theano/), [torch](http://torch.ch/) or [tensorflow](http://www.tensorflow.org/)I would suggest you use one of the tools mentioned above rather than use this toolbox.Best, Rasmus.DeepLearnToolbox================A Matlab toolbox for Deep Learning.Deep Learning is a new subfield of machine learning that focuses on learning deep hierarchical models of data.It is inspired by the human brain's apparent deep (layered, hierarchical) architecture.A good overview of the theory of Deep Learning theory is[Learning Deep Architectures for AI](http://www.iro.umontreal.ca/~bengioy/papers/ftml_book.pdf)For a more informal introduction, see the following videos by Geoffrey Hinton and Andrew Ng.* [The Next Generation of Neural Networks](http://www.youtube.com/watch?v=AyzOUbkUf3M) (Hinton, 2007)* [Recent Developments in Deep Learning](http://www.youtube.com/watch?v=VdIURAu1-aU) (Hinton, 2010)* [Unsupervised Feature Learning and Deep Learning](http://www.youtube.com/watch?v=ZmNOAtZIgIk) (Ng, 2011)If you use this toolbox in your research please cite [Prediction as a candidate for learning deep hierarchical models of data](http://www2.imm.dtu.dk/pubdb/views/publication_details.php?id=6284)```@MASTERSTHESIS\{IMM2012-06284, author = "R. B. Palm", title = "Prediction as a candidate for learning deep hierarchical models of data", year = "2012",}```Contact: rasmusbergpalm at gmail dot comDirectories included in the toolbox-----------------------------------`NN/` - A library for Feedforward Backpropagation Neural Networks`CNN/` - A library for Convolutional Neural Networks`DBN/` - A library for Deep Belief Networks`SAE/` - A library for Stacked Auto-Encoders`CAE/` - A library for Convolutional Auto-Encoders`util/` - Utility functions used by the libraries`data/` - Data used by the examples`tests/` - unit tests to verify toolbox is workingFor references on each library check REFS.mdSetup-----1. Download.2. addpath(genpath('DeepLearnToolbox'));Example: Deep Belief Network---------------------```matlabfunction test_example_DBNload mnist_uint8;train_x = double(train_x) / 255;test_x = double(test_x) / 255;train_y = double(train_y);test_y = double(test_y);%% ex1 train a 100 hidden unit RBM and visualize its weightsrand('state',0)dbn.sizes = [100];opts.numepochs = 1;opts.batchsize = 100;opts.momentum = 0;opts.alpha = 1;dbn = dbnsetup(dbn, train_x, opts);dbn = dbntrain(dbn, train_x, opts);figure; visualize(dbn.rbm{1}.W'); % Visualize the RBM weights%% ex2 train a 100-100 hidden unit DBN and use its weights to initialize a NNrand('state',0)%train dbndbn.sizes = [100 100];opts.numepochs = 1;opts.batchsize = 100;opts.momentum = 0;opts.alpha = 1;dbn = dbnsetup(dbn, train_x, opts);dbn = dbntrain(dbn, train_x, opts);%unfold dbn to nnnn = dbnunfoldtonn(dbn, 10);nn.activation_function = 'sigm';%train nnopts.numepochs = 1;opts.batchsize = 100;nn = nntrain(nn, train_x, train_y, opts);[er, bad] = nntest(nn, test_x, test_y);assert(er < 0.10, 'Too big error');```Example: Stacked Auto-Encoders---------------------```matlabfunction test_example_SAEload mnist_uint8;train_x = double(train_x)/255;test_x = double(test_x)/255;train_y = double(train_y);test_y = double(test_y);%% ex1 train a 100 hidden unit SDAE and use it to initialize a FFNN% Setup and train a stacked denoising autoencoder (SDAE)rand('state',0)sae = saesetup([784 100]);sae.ae{1}.activation_function = 'sigm';sae.ae{1}.learningRate = 1;sae.ae{1}.inputZeroMaskedFraction = 0.5;opts.numepochs = 1;opts.batchsize = 100;sae = saetrain(sae, train_x, opts);visualize(sae.ae{1}.W{1}(:,2:end)')% Use the SDAE to initialize a FFNNnn = nnsetup([784 100 10]);nn.activation_function = 'sigm';nn.learningRate = 1;nn.W{1} = sae.ae{1}.W{1};% Train the FFNNopts.numepochs = 1;opts.batchsize = 100;nn = nntrain(nn, train_x, train_y, opts);[er, bad] = nntest(nn, test_x, test_y);assert(er < 0.16, 'Too big error');```Example: Convolutional Neural Nets---------------------```matlabfunction test_example_CNNload mnist_uint8;train_x = double(reshape(train_x',28,28,60000))/255;test_x = double(reshape(test_x',28,28,10000))/255;train_y = double(train_y');test_y = double(test_y');%% ex1 Train a 6c-2s-12c-2s Convolutional neural network %will run 1 epoch in about 200 second and get around 11% error. %With 100 epochs you'll get around 1.2% errorrand('state',0)cnn.layers = { struct('type', 'i') %input layer struct('type', 'c', 'outputmaps', 6, 'kernelsize', 5) %convolution layer struct('type', 's', 'scale', 2) %sub sampling layer struct('type', 'c', 'outputmaps', 12, 'kernelsize', 5) %convolution layer struct('type', 's', 'scale', 2) %subsampling layer};cnn = cnnsetup(cnn, train_x, train_y);opts.alpha = 1;opts.batchsize = 50;opts.numepochs = 1;cnn = cnntrain(cnn, train_x, train_y, opts);[er, bad] = cnntest(cnn, test_x, test_y);%plot mean squared errorfigure; plot(cnn.rL);assert(er<0.12, 'Too big error');```Example: Neural Networks---------------------```matlabfunction test_example_NNload mnist_uint8;train_x = double(train_x) / 255;test_x = double(test_x) / 255;train_y = double(train_y);test_y = double(test_y);% normalize[train_x, mu, sigma] = zscore(train_x);test_x = normalize(test_x, mu, sigma);%% ex1 vanilla neural netrand('state',0)nn = nnsetup([784 100 10]);opts.numepochs = 1; % Number of full sweeps through dataopts.batchsize = 100; % Take a mean gradient step over this many samples[nn, L] = nntrain(nn, train_x, train_y, opts);[er, bad] = nntest(nn, test_x, test_y);assert(er < 0.08, 'Too big error');%% ex2 neural net with L2 weight decayrand('state',0)nn = nnsetup([784 100 10]);nn.weightPenaltyL2 = 1e-4; % L2 weight decayopts.numepochs = 1; % Number of full sweeps through dataopts.batchsize = 100; % Take a mean gradient step over this many samplesnn = nntrain(nn, train_x, train_y, opts);[er, bad] = nntest(nn, test_x, test_y);assert(er < 0.1, 'Too big error');%% ex3 neural net with dropoutrand('state',0)nn = nnsetup([784 100 10]);nn.dropoutFraction = 0.5; % Dropout fraction opts.numepochs = 1; % Number of full sweeps through dataopts.batchsize = 100; % Take a mean gradient step over this many samplesnn = nntrain(nn, train_x, train_y, opts);[er, bad] = nntest(nn, test_x, test_y);assert(er < 0.1, 'Too big error');%% ex4 neural net with sigmoid activation functionrand('state',0)nn = nnsetup([784 100 10]);nn.activation_function = 'sigm'; % Sigmoid activation functionnn.learningRate = 1; % Sigm require a lower learning rateopts.numepochs = 1; % Number of full sweeps through dataopts.batchsize = 100; % Take a mean gradient step over this many samplesnn = nntrain(nn, train_x, train_y, opts);[er, bad] = nntest(nn, test_x, test_y);assert(er < 0.1, 'Too big error');%% ex5 plotting functionalityrand('state',0)nn = nnsetup([784 20 10]);opts.numepochs = 5; % Number of full sweeps through datann.output = 'softmax'; % use softmax outputopts.batchsize = 1000; % Take a mean gradient step over this many samplesopts.plot = 1; % enable plottingnn = nntrain(nn, train_x, train_y, opts);[er, bad] = nntest(nn, test_x, test_y);assert(er < 0.1, 'Too big error');%% ex6 neural net with sigmoid activation and plotting of validation and training error% split training data into training and validation datavx = train_x(1:10000,:);tx = train_x(10001:end,:);vy = train_y(1:10000,:);ty = train_y(10001:end,:);rand('state',0)nn = nnsetup([784 20 10]); nn.output = 'softmax'; % use softmax outputopts.numepochs = 5; % Number of full sweeps through dataopts.batchsize = 1000; % Take a mean gradient step over this many samplesopts.plot = 1; % enable plottingnn = nntrain(nn, tx, ty, opts, vx, vy); % nntrain takes validation set as last two arguments (optionally)[er, bad] = nntest(nn, test_x, test_y);assert(er < 0.1, 'Too big error');```[![Bitdeli Badge](https://d2weczhvl823v0.cloudfront.net/rasmusbergpalm/deeplearntoolbox/trend.png)](https://bitdeli.com/free "Bitdeli Badge")

PAT 甲级 1029 （Median）

PAT 甲级 1029题目要求翻译代码思路题目要求 Given an increasing sequence S of N integers, the median is the number at the middle position. For example, the median of S1 = { 11, 12, 13, 14 } is 12, and the median of S2 = { 9, 10, 15, 16, 17 } is 15. The median of two sequen

qq_42865772的博客 243

visio安装包

Microsoft Office Visio 是一款专业的制图软件。利用经过更新的形状、协作工具和数据链接图表，创建专业级图表以简化复杂的信息。

PAT甲级1029 Median (25分)|C++实现

一、题目描述原题链接 Given an increasing sequence S of N integers, the median is the number at the middle position. For example, the median of S1 = { 11, 12, 13, 14 } is 12, and the median of S2 = { 9, 10, 15, 16, 17 } is 15. The median of two sequences is defined

weixin_42393947的博客 194

PAT甲级1029 Median：[C++题解]贪心、二路归并

刷题

阿正的梦工坊 626

PAT 甲级 1029 Median

1029 Median （25 point(s)） Given an increasing sequence S of N integers, the median is the number at the middle position. For example, the median of S1 = { 11, 12, 13, 14 } is 12, and the median of S2...

漫浸天空的雨色的备忘录~ 774

题140.pat甲级练习-1029 Median (25 分)

文章目录题140.pat甲级练习-1029 Median (25 分)一、题目二、题解题140.pat甲级练习-1029 Median (25 分) 一、题目二、题解本题就是要你求两个非递减序列合并之后的中位数，若第一个数编号为1，最后一个数编号为k，显然题目所说的中位数位置为k/2，所以我们不妨将res从下标为1开始放，这样便于不过脑地输出（当时就nt从下标为0开始放，然后还直接输出res[k/2]） #include <bits/stdc++.h> using namesp

Adongua的博客 204

PAT甲级(Advanced Level) Practice 1029 Median

给定两个升序数组，找到他们合并后的中位数，中位数是数组中第(len+1)/2大的数。二分算法详见力扣官方题解。

2301_78006009的博客 356

PAT 甲级 1029 Median

PAT 甲级 1029 Median #include <bits/stdc++.h> using namespace std; int main() { #ifdef LOCAL freopen("input.txt", "r", stdin); #endif // Input int n; cin >> n; vector<long long> nums1(n); for (auto& i : nums1) ci

桂圆儿的仓库 125

PAT甲级 1029 Median (25分)

1029 Median (25分) 题目链接：PAT A 1029 题目大意：给出两个升序的序列，要求输出将他们合并后序列的中位数。思路分析：由于只需要输出合并序列的中位数，所以其实没必要将两个序列合并到一起。可以采用一种算法思想：two pointers。即定义两个变量i和j，分别从两个序列的开始扫描这两个序列，如果a[i]<b[j]，就让i自增，否则让j自增，当到达中位数的下标时退出...

weixin_43684054的博客 252

PAT A1029 Median (25分)

PAT甲级：A1029 Median (25分) Given an increasing sequence S of N integers, the median is the number at the middle position. For example, the median of S1 = { 11, 12, 13, 14 } is 12, and the median of S2 =...

只想用最简短的代码刷题 152

PAT 甲级 1029 Median【归并】

贴两个AC代码：前一个是用merge()函数，偷个懒后一个是自己写的归并 //代码1 const int maxn = 200000 + 5; int n1,n2; long s1[maxn],s2[maxn]; int main(){ scanf("%d",&n1); for(int i=0;i<n1;++i) scanf("%ld",s1+i); ...

之虎者也的博客 162

pat甲级1029 Median

Given an increasing sequence S of N integers, the median is the number at the middle position. For example, the median of S1 = { 11, 12, 13, 14 } is 12, and the median of S2 = { 9, 10, 15, 16, 17 } is 15. The median of two sequences is defined to be the me

immortalsx的博客 320

PAT甲级1029 Median

代码： #include <iostream> #include <climits> #include <queue> using namespace std; int main() { queue<int> a, b; int n, m, num, cnt = 0; scanf("%d", &n); for(int i = 0; i < n; i++) { scanf("%d", &num

weixin_43801993的博客 152

pat 甲级 1029 Median

在pat没修改的时候好像sort或者nth_element 可以过现在加了内存限制，好多代码都不行了这个是第一版（不加内存限制好简单啊）；学习一下nth_element (a,b,c); 在&lt;algortithm&gt;里 #include &lt;cstdio&gt; #include &lt;iostream&gt; #include &lt;algorithm&

咸鱼之井的博客 311

上一篇： PAT甲级 1028 List Sorting

下一篇： PAT甲级 1032 Sharing

Dify-前端本地运行-单点登录

weixin_43163457的博客

06-19

3224