Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- #include <iomanip>
- using namespace std;
- int main() {
- long A [100];
- long n;
- long koef=0;
- long max;
- long temp=0;
- cin>>n;
- for (int i=0;i<n;i++){
- cin >>A[i];
- }
- for (int i=0;i<n;i++){
- for (int j=i+1; j<n; j++){
- if (A[i]>A[j]){
- temp = A[i];
- A[i]=A[j];
- A[j]=temp;
- }
- }
- }
- for (int i=0; i<n;i++){
- if (A[i]!=A[i+1] && A[i]!=A[i-1] ){
- koef++;
- if (koef == 1){
- max=A[i];
- }
- else if (koef>1 && A[1]>max){
- max=A[i];
- }
- }
- }
- if (koef==0){
- cout << "NO";
- }
- else if (koef>0){
- cout <<max<<endl;
- }
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement