求助,qsort全WA QWQ
查看原帖
求助,qsort全WA QWQ
136596
尤斯蒂亚楼主2020/12/23 11:42
#include<iostream>
#include<stdio.h>
#include<bits/stdc++.h>
#include<algorithm>
using namespace std;
int line[100000];

void test(int n)
{
	for (int k=1;k<=n;++k)
	cout<<line[k]<<" ";
	cout<<endl;
}

int main()
{
	int n;
	int work,num;
	int now=0;
	cin>>n;
	for (int i=1;i<=n;i++)
	{
		cin>>work>>num;
		if (work==5)
		{
			now++;
			line[now]=num;	
		}
		
		if (work==1)
		{
			sort(line+1,line+now+1);
			for (int j=1;j<=now;++j)
			{
				if (line[j]==num)
				{
					cout<<j<<endl;
					break;
				}
			}
		}
		
		if (work==2)
		{
			sort(line+1,line+now+1);
			//if (line[num==0]) cout<<"-2147483647"<<endl; else
			cout<<line[num]<<endl;
		}
		
		if (work==3)
		{
			sort(line+1,line+now+1);
			for (int j=1;j<=now;++j)
			{
				if (line[j]==num)
				{
					if (j==1)
					{
						cout<<"-2147483647"<<endl;
						break;
					}
					else {
					cout<<line[j-1]<<endl;
					break;
				}
				}
			}
		}
		
		if (work==4)
		{
			sort(line+1,line+now+1);
			for (int j=now;j>=1;--j)
			{
				if (line[j]==num)
				{
					if (j==now)
					{
						cout<<"2147483647"<<endl;
						break;
					}
					else {
					cout<<line[j+1]<<endl;
					break;
				}
				
				}
			}
		}
	}
	//test(now);
	return 0;
} 
2020/12/23 11:42
加载中...