2 solutions
-
1
#include<bits/stdc++.h> using namespace std; int main() { int n,k; cin>>n>>k; int c[100000]={},d[100000]={}; for(int i=0;i<n;i++) { cin>>c[i]; d[i]=c[i]; } sort(d,d+n); int min=d[0]; int max=d[n-1]; for(int i=0;i<n;i++) { if(c[i]<k) { c[i]=min; } else if(c[i]>k) { c[i]=max; } cout<<c[i]<<" "; } } -
-1
C++ :
#include <bits/stdc++.h> using namespace std; int main(){ int n,k,mi=100000,ma=-100000; cin>>n>>k; int arr[n]={0}; for(int i=0;i<n;++i){ cin>>arr[i]; if(arr[i]<mi) mi=arr[i]; else if(arr[i]>ma) ma=arr[i]; } for(int i=0;i<n;++i){ if(arr[i]<k) cout<<mi; else if(arr[i]>k) cout<<ma; else cout<<arr[i]; cout<<' '; } }
- 1
Information
- ID
- 53
- Time
- 1000ms
- Memory
- 128MiB
- Difficulty
- 10
- Tags
- # Submissions
- 6
- Accepted
- 5
- Uploaded By