Advertisement
Guest User

Untitled

a guest
Apr 26th, 2018
66
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 0.62 KB | None | 0 0
  1. #include <iostream>
  2. #include <iomanip>
  3. using namespace std;
  4. int main() {
  5. long A [100];
  6. long n;
  7. long koef=0;
  8. long max;
  9. long temp=0;
  10. cin>>n;
  11. for (int i=0;i<n;i++){
  12. cin >>A[i];
  13. }
  14. for (int i=0;i<n;i++){
  15. for (int j=i+1; j<n; j++){
  16. if (A[i]>A[j]){
  17.  
  18. temp = A[i];
  19. A[i]=A[j];
  20. A[j]=temp;
  21. }
  22. }
  23. }
  24. for (int i=0; i<n;i++){
  25. if (A[i]!=A[i+1] && A[i]!=A[i-1] ){
  26. koef++;
  27. if (koef == 1){
  28. max=A[i];
  29. }
  30. else if (koef>1 && A[1]>max){
  31. max=A[i];
  32. }
  33. }
  34. }
  35. if (koef==0){
  36. cout << "NO";
  37. }
  38. else if (koef>0){
  39. cout <<max<<endl;
  40. }
  41. return 0;
  42. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement