脑瘫解法

using namespace std;
const int B=101;
int m[B],p[B],q[B]; 
int main() {
	int sum=0,a,k=0,g=0,f=0;
	while(cin>>a) {
		m[sum]=a;
		q[sum]=a;
		sum++;
	}
	int b=m[sum-1];
	for(int i=sum-2; i>=0; i--) {
		if(b==m[i]) {
			m[i]=999;
			k++;
		}
	}
	if(k>0) {
		for(int y=0;y<=sum-2;y++){
			if(m[y]==q[y]){
				g++;
			}
			else if(m[y]!=q[y]){
				g++;
				cout<<g<<" ";
			}
		}
		cout<<endl;
			for(int i=0; i<=sum-2; i++) {
				if(m[i]!=999) {
					cout<<m[i]<<" ";
				}
			}
		}
	    else if(k==0) {
		for(int i=1; i<=999; ++i) {
			for(int i=1; i<=sum-1; ++i) {
				if(m[i-1]>m[i]) {
					swap(m[i-1],m[i]);
				}
			}
		}
		for(int h=0;h<=sum-1;++h){
			if(q[h]<=b){
				f++;
			}
	        if(q[h]>b){
				f++;
				cout<<f;
				break;
			}
	        if(h==sum-2)
			{f++;
			 cout<<f;
			 break;
			}
		}
		cout<<endl;
		for(int h=0; h<=sum-1; h++) {
			cout<<m[h]<<" ";
		}
	}
	return 0;
}