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]<<" "; } }
Information
- ID
- 53
- Time
- 1000ms
- Memory
- 128MiB
- Difficulty
- 10
- Tags
- # Submissions
- 6
- Accepted
- 5
- Uploaded By