1 solutions
-
0
C++ :
#include<bits/stdc++.h> using namespace std; int n,m,a[105]; bool cmp(int a,int b) { return a>b; } int main(){ cin>>n>>m; for(int i=1;i<=n;i++) cin>>a[i]; while(m--) { sort(a+1,a+1+n,cmp); a[1]/=2; int tmp=0; for(int i=1;i<=n;i++) if(a[i]==0) tmp++; if(tmp==n) break; } sort(a+1,a+1+n,cmp); for(int i=n;i>=1;i--) cout<<a[i]<<" "; return 0; }
- 1
Information
- ID
- 746
- Time
- 1000ms
- Memory
- 128MiB
- Difficulty
- 9
- Tags
- # Submissions
- 25
- Accepted
- 3
- Uploaded By