当前位置：网站首页>[acwing] 60th weekly match b- 4495 Array operation

[acwing] 60th weekly match b- 4495 Array operation

2022-07-19 10:41:00 【*DDL_ GzmBlog】

Preface

$t a g :$ simulation STL Sort

Portal :
This question 10 Minutes before shipment , Read the title several times , Dizzy today belongs to

Ideas :
We just need Sort , Sort !, Then directly simulate

We need to calculate the value to be subtracted in real time

Then every time you reduce , The timely kick has been reduced to $0$ Value

code :

ll n,k;
vector<ll> v;
int i,j;
void solve(){
    
	cin>>n>>k;
	Fup(i,1,n){
    
	//for(int i=1;i<=n;i++)  Equate to 
		int x;cin>>x;
		if(!x)continue;
		v.pb(x);
	}
	
	sort(all(v),greater<int>());
	
	int d  = 0 ;
	// Calculate the difference that needs to be subtracted 
	while(k -- ){
    
		if(v.size() == 0){
    
			cout<<0<<endl;
			continue;
		}
		if(v.back() - d !=0){
    
			cout<<v.back()-d<<endl;
			d+=(v.back()-d);
			// There may be multiple identical ones, so you need while 
			while(v.back() -d == 0)
			v.pop_back();
		}else cout<<0<<endl;
	}

}

原网站

版权声明
本文为[*DDL_ GzmBlog]所创，转载请带上原文链接，感谢
https://yzsam.com/2022/200/202207171239118085.html

当前位置：网站首页>[acwing] 60th weekly match b- 4495 Array operation

[acwing] 60th weekly match b- 4495 Array operation

Preface

边栏推荐

猜你喜欢

随机推荐