【洛谷算法1-2】【排序】习题解析

P1271 【深基9.例1】选举学生会 题解 【水题】

https://www.luogu.com.cn/problem/P1271

方法一: sort()

#include<cstdio>
#include<iostream>
#include<algorithm>
using namespace std;
int a[2000005];
int main(void)
{
	int n,m;
	cin>>n>>m;
	for(int i=0;i<m;i++) scanf("%d",&a[i]);
	sort(a,a+m);
	for(int i=0;i<m;i++) printf("%d ",a[i]);
	return 0;
} 

方法二: 桶排序

#include<cstdio>
#include<iostream>
#include<algorithm>
using namespace std;
int a[1005];
int number;
int main(void)
{
	int n,m;
	cin>>n>>m;
	for(int i=0;i<m;i++) scanf("%d",&number),a[number]++;
	for(int i=1;i<=n;i++) 
	while(a[i]--) printf("%d ",i);
	cout<<endl;
	return 0;
} 

P1177 【模板】快速排序

https://www.luogu.com.cn/problem/P1177

#include<cstdio>
#include<iostream>
#include<algorithm>
using namespace std;
const int N=1e5+10;
int a[N];
void quick_sort(int l,int r)
{
	if(l>=r) return ;
	int i=l-1,j=r+1,x=a[l+r>>1];
	while(i<j)
	{
		do i++; while(a[i]<x);
		do j--; while(a[j]>x);
		if(i<j) swap(a[i],a[j]);
	}
	quick_sort(l,j),quick_sort(j+1,r);
}
int main(void)
{
	int n; cin>>n;
	for(int i=0;i<n;i++) cin>>a[i];
	quick_sort(0,n-1);
	for(int i=0;i<n;i++) cout<<a[i]<<" ";
	return 0;
} 

P1923 【深基9.例4】求第 k 小的数

https://www.luogu.com.cn/problem/P1923

#include<cstdio>
#include<iostream>
#include<algorithm>
using namespace std;
const int N=1e7+10;
int a[N],n,k;
int main(void)
{
	cin>>n>>k;
	for(int i=0;i<n;i++) scanf("%d",&a[i]);
	sort(a,a+n);
	cout<<a[k]<<endl;
	return 0;
}

#include<iostream>
#include<cstdio>
#include<algorithm>
using namespace std;
const int N=1e7+10;
int a[N],n,k;
int quick_sort(int l,int r,int k)
{
	if(l>=r) return a[l];
	int i=l-1,j=r+1,x=a[l+r>>1];
	while(i<j)
	{
		do i++;while(a[i]<x);
		do j--;while(a[j]>x);
		if(i<j) swap(a[i],a[j]);
	}
	int s=j-l+1;
	if(s>=k) return quick_sort(l,j,k);
	else return quick_sort(j+1,r,k-s);
}
int main(void)
{
	cin>>n>>k;
	for(int i=0;i<n;i++) scanf("%d",&a[i]);
	cout<<quick_sort(0,n-1,k+1)<<endl;
	return 0;
}

P1059 [NOIP2006 普及组] 明明的随机数

https://www.luogu.com.cn/problem/P1059

#include<cstring>
#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<set>
using namespace std;
int a[101];
set<int>st;
int main(void)
{
	int n; cin>>n;
	int i;
	int number=0;
	for(int i=0;i<n;i++) 
	{
		cin>>a[i];
		st.insert(a[i]);
	}
	cout<<st.size()<<endl;
	for(set<int>::iterator it=st.begin();it!=st.end();it++)
	{
		cout<<*it<<" ";
	}
	cout<<endl;
	return 0;
} 

P1093 [NOIP2007 普及组] 奖学金

https://www.luogu.com.cn/problem/P1093

#include<cstdio>
#include<iostream>
#include<algorithm>
using namespace std;
const int N=305;
struct student
{
	int chinese,math,english,id;
	int sum;
}stu[N];
bool cmp(student a,student b)
{
	if(a.sum==b.sum)
	{
		if(a.chinese==b.chinese)
			return a.id<b.id;
		return a.chinese>b.chinese;
	}
	return a.sum>b.sum;
} 
int main(void)
{
	int n; cin>>n;
	for(int i=0;i<n;i++) 
	{
		cin>>stu[i].chinese>>stu[i].math>>stu[i].english;
		stu[i].sum=stu[i].chinese+stu[i].english+stu[i].math;
		stu[i].id=i;
	}
	sort(stu,stu+n,cmp);
	for(int i=0;i<5&&i<n;i++) cout<<stu[i].id+1<<" "<<stu[i].sum<<endl;
	return 0;
}

P1781 宇宙总统

https://www.luogu.com.cn/problem/P1781

#include<algorithm>
#include<cstdio>
#include<iostream>
using namespace std;
struct student
{
	int id;
	string s;
}stu[35];
bool cmp(student a,student b)
{
	if(a.s.size()!=b.s.size())
		return a.s.size()>b.s.size();
	return a.s>b.s;
}
int main(void)
{
	int n; cin>>n;
	for(int i=0;i<n;i++) cin>>stu[i].s,stu[i].id=i+1;
	sort(stu,stu+n,cmp);
	cout<<stu[0].id<<endl;
	cout<<stu[0].s<<endl; 
	return 0;
}

P2676 [USACO07DEC]Bookshelf B

https://www.luogu.com.cn/problem/P2676

#include<cstdio>
#include<algorithm>
using namespace std;
int a[20005];
int main(void)
{
	int n,i;
	long int m,sum;
	int number=0;
	scanf("%d %ld",&n,&m);
	for(i=0;i<n;i++)
	{
		scanf("%d",&a[i]); 
	} 
	sort(a,a+n);
	sum=0;
	for(i=n-1;i>0;i--)
	{
		if(sum>=m)
		{
			break;
		}
		else
		{
			sum+=a[i];
			number++;
		}
	}
	printf("%d\n",number);
	return 0;
}

P1116 车厢重组

https://www.luogu.com.cn/problem/P1116

#include<cstdio>
#include<iostream>
using namespace std;
const int N=1e5;
int a[N];
int ans,n;
void F()
{
	for(int i=0;i<n-1;i++)
	{
		for(int j=0;j<n-1-i;j++)
		{
			if(a[j]>a[j+1]) 
			{
				int temp=a[j];
				a[j]=a[j+1];
				a[j+1]=temp;
				ans++;
			}
		} 
	}
}
int  main(void)
{
	cin>>n;
	for(int i=0;i<n;i++) cin>>a[i];
	F();
	cout<<ans<<endl;
	return 0;
}

P1152 欢乐的跳

https://www.luogu.com.cn/problem/P1152

#include<cstdio>
#include<iostream>
#include<cmath>
using namespace std;
bool hush[1005];
int a[1005];
int main(void)
{
	int n; cin>>n;
	for(int i=0;i<n;i++) cin>>a[i];
	for(int i=1;i<n;i++)
	{
		long long int sum=abs(a[i]-a[i-1]);
		if(sum<=n-1) hush[sum]=true;
	} 
	int i=1;
	for(;i<=n-1;i++)
	{
		if(!hush[i]) break;
	}
	if(i==n) cout<<"Jolly"<<endl;
	else cout<<"Not jolly"<<endl; 
	return 0;
} 

P1068 [NOIP2009 普及组] 分数线划定

https://www.luogu.com.cn/problem/P1068

#include<cstdio>
#include<iostream>
#include<algorithm>
#include<set>
using namespace std;
struct student
{
	int id,score;
}stu[5005],s[5005];
bool cmp(student a,student b)
{
	if(a.score==b.score)
		return a.id<b.id;
	return a.score>b.score;
}
int n,k;
set<int>st;
int main(void)
{
	cin>>n>>k;
	k=k*3/2;
	for(int i=0;i<n;i++) cin>>stu[i].id>>stu[i].score;
	sort(stu,stu+n,cmp);
	int index=k-1; 
	int score=stu[k-1].score;//最后的分数 
	while(1)
	{
		++index;//加上重复的 
		if(score!=stu[index].score) break;
	}
	cout<<score<<" "<<index<<endl; 
	for(int i=0;i<index;i++)
	{
		cout<<stu[i].id<<" "<<stu[i].score<<endl;
	}
	return 0;
}

P5143 攀爬者

https://www.luogu.com.cn/problem/P5143

#include<cstdio> 
#include<iostream>
#include<cstdio>
#include<cmath>
#include<algorithm>
using namespace std;
struct student
{
	int  x,y,z;
}stu[50005];
bool cmp(student a,student b)
{
	return a.z<b.z;
}
int main(void)
{
	int n; cin>>n;
	for(int i=0;i<n;i++) scanf("%d%d%d",&stu[i].x,&stu[i].y,&stu[i].z);
	sort(stu,stu+n,cmp); 
	double sum=0;
	for(int i=1;i<n;i++)
	{
		sum+=sqrt(1.0*pow(abs(stu[i].x-stu[i-1].x),2)+1.0*pow(abs(stu[i].y-stu[i-1].y),2)+pow(abs(stu[i].z-stu[i-1].z),2));
	}
	printf("%.3lf",sum);
	return 0;
} 

P1104 生日

https://www.luogu.com.cn/problem/P1104

#include<cstdio>
#include<iostream>
#include<algorithm>
#include<string>
using namespace std;
struct student
{
	int id;
	string name;
	int year;
	int month;
	int day;
}stu[105];
bool cmp(student a,student b)
{
	if(a.year==b.year)
	{
		if(a.month==b.month)
		{
			if(a.day==b.day)
				return a.id>b.id;
			return a.day<b.day;
		}
		return a.month<b.month;
	} 
	return a.year<b.year; 
}
int main(void)
{
	int n; cin>>n;
	for(int i=0;i<n;i++) cin>>stu[i].name>>stu[i].year>>stu[i].month>>stu[i].day,stu[i].id=i;
	sort(stu,stu+n,cmp);
	for(int i=0;i<n;i++) cout<<stu[i].name<<endl;
	return 0;
}

P1012 [NOIP1998 提高组] 拼数 【有意思】

https://www.luogu.com.cn/problem/P1012

#include<cstdio>
#include<iostream>
#include<string>
#include<algorithm>
using namespace std;
string s[25];
string ans;
bool cmp(string a,string b)
{
	return a+b>b+a;
//自定义排序函数，这一步非常巧妙，假设a=321，b=32；a+b=32132，b+a=32321这样下面sort排下来就是32>321避免出现32132>32321的情况 
}
int main(void)
{
	int n; cin>>n;
	for(int i=0;i<n;i++) cin>>s[i];
	sort(s,s+n,cmp);
	for(int i=0;i<n;i++) ans+=s[i];
	cout<<ans<<endl;
	return 0;
}