1029. Median (25)
来源:互联网 发布:网络视频直播服务 编辑:程序博客网 时间:2024/04/29 17:16
cin会超时,cin会超时,用scanf
#define _CRT_SECURE_NO_WARNINGS
#include<string>#include<string.h>
#include<vector>
#include<map>
#include<iostream>
#include<algorithm>
#include<stdio.h>
using namespace std;
int main()
{
int N, M;
cin >> N;
int *a = new int[N];
for (int i = 0; i < N; i++)
{
scanf("%d",&a[i]);
}
cin >> M;
int i_a = 0, i_b = 0,i_c = 0,mid=(N+M-1)/2;
int *b = new int[M];
int *c = new int[N + M];
scanf("%d", &b[0]);
while (i_b < M&&i_a<N)
{
if (a[i_a] < b[i_b])
{
c[i_c++] = a[i_a++];
}
else if (a[i_a] == b[i_b])
{
c[i_c++] = a[i_a++];
c[i_c++] = b[i_b++];
scanf("%d", &b[i_b]);
}
else
{
c[i_c++] = b[i_b++];
if (i_b<M)
scanf("%d", &b[i_b]);
}
if (i_c > mid)
{
cout << c[mid];
return 0;
}
}
while (i_c <= mid&&i_b<M)
{
c[i_c++] = b[i_b++];
if (i_b<M)
scanf("%d", &b[i_b]);
}
while (i_c <= mid&&i_a<N)
{
c[i_c++] = a[i_a++];
}
cout << c[mid];
return 0;
}
0 0
- 1029. Median (25)
- 1029. Median (25)-PAT
- 【PAT】1029. Median (25)
- 1029. Median (25)
- 1029. Median (25)
- PAT 1029. Median (25)
- 1029. Median (25)
- PAT 1029. Median (25)
- PAT 1029. Median (25)
- 1029. Median (25)
- 1029. Median (25)
- 1029. Median (25)
- 1029. Median (25)
- 1029. Median (25)
- 1029. Median (25)
- 1029. Median (25)
- pat 1029. Median (25)
- 1029. Median (25)
- 获取plist文件的全路径
- listview滑动到顶部再往下拉的时候有条缝隙
- Linux SPI总线和设备驱动架构之一:系统概述
- python学习笔记
- NPOIHelper
- 1029. Median (25)
- OpenMP笔记:入门
- 最小生成树算法(2)------------Kruskal
- 第15周-阅读项目2-异常处理&&命名空间
- 三种读取Excel方法
- 蓝牙BLE主从机中GAP几种状态的解释
- hdu 1535 Invitation Cards
- android的数据存储方式---5种方法
- 每天一个linux命令(39):grep 命令