输入n个数,输出第k大个数

#include<iostream>
#include<malloc.h>
using namespace std;

struct data
{
	double a;
	struct data *next;
};

int main()
{
	int n, k, t;
	int i = 0;
	struct data *head, *p, *q;
	head = (struct data *)malloc(sizeof(struct data));
	head->next = NULL;
	p = head;
	cout << "输入n" << endl;
	cin >> n;
	cout << "输入" << n << "个数" << endl;
	while (n > 0)//会多创一块内存
	{
		cin >> p->a;
		q = (struct data *)malloc(sizeof(struct data));
		q->next = NULL;
		p->next = q;
		p = q;
		q = q->next;
		n--;
	}
	
	cout << "输入k" << endl;
	cin >> k;
	t = k;
	double x;
	for (p = head; p->next != NULL; p = p->next)
	{
		for (q = p->next; q->next != NULL; q = q->next)
		{
			if (p->a < q->a)
			{
				x = p->a;
				p->a = q->a;
				q->a = x;
			}

		}
		k--;
		if (k == 0)
			break;
	}
	cout << "第" << t << "大的数: ";
	cout << p->a << endl;
	p = head;
	while (p != NULL)
	{
		q = p->next;
		free(p);
		p = q;
	}
	head = NULL;
	return 0;
}
  • 1
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值