030300310[6].cpp

对于给定的由n个自然数组成的多重集S

#include<iostream>
#include<fstream>
using namespace std;
int n;
void CountingSort(int a[],int m)
{
	int b,y;
	int c[99999];
	ifstream in("input.txt");
	if(in.fail())
    {
		cout<<"the input.txt is not exist!";
		exit(1);
	}
	ofstream out("output.txt");
	for(int j=0;j<=m;j++)
		c[j]=0;
	for(int i=0;i<n;i++)
		c[a[i]]+=1;
	b=c[0];
	for(int k=1;k<=m;k++)
	{
		if(b<c[k])
		{
		   b=c[k];
		   y=k;
		}
		else continue;
	}
	out<<y<<'\n';
	out<<b;	
}
int main()
{
	int x;
	ifstream in("input.txt");
	if(in.fail())
    {
		cout<<"the input.txt is not exist!";
		exit(1);
	}
	ofstream out("output.txt");
	in>>n;
	int *a=new int[n];
	for(int j=0;j<n;j++)
		in>>a[j];
		x=a[0];
		for(int i=1;i<n;i++)
		{
		   if(a[i]>x)
			x=a[i];
		   else continue;
		}
	CountingSort(a,x);
	return 0;
}