eolymp
bolt
Try our new interface for solving problems
Problems

Maximums to the right

published at 6/29/22, 10:02:35 am

Треба брати останню

published at 1/10/24, 7:38:29 pm

include <stdio.h>

int main() { int n,s=0; scanf("%d",&n); int x[n]; for(int i=0;i<n;i++){ scanf("%d ",&x[i]);} int p=x[0]; for(int i=0;i<n;i++){ if(p<x[i]){ p=x[i];}} for(int i=0;i<n;i++){ if(x[i]!=p){ printf("%d ",x[i]); s++;}} for(int i=0;i<n-s;i++){ printf("%d ",p); } //Zakirr02 burdadisa shellenin

 return 0;

}