#include <iostream>
#include <vector>
#include <cmath>
#include <set>
using namespace std;
void swap(int *a, int *b){
int temp = *a;
*a = *b;
*b = temp;
}
signed main() {
set<pair<int,int>> s;
int n;
cin >> n;
vector<int> a(n);
for(int &i:a)
cin >> i;
int m;
cin >> m;
while(m--){
int x,y;
cin >> x >> y;
s.insert({x,y});
s.insert({y,x});
}
for(int i = 0; i < n; i++)
for(int j = 0; j < n - i - 1; j++)
if(a[j] > a[j+1] && s.find({a[j],a[j+1]}) == s.end())
swap(a[j],a[j+1]);
for(int &i:a)
cout << i << " ";
}
#include <iostream>
#include <math.h>
#define _USE_MATH_DEFINES
int main(){
double a,b,c = 1;
std::cout << "A:"<< std::endl;
std::cin >> a ;
std::cout << "B:"<< std::endl;
std::cin >> b;
std::cout << "C:"<< std::endl;
std::cin >> c;
double x = 2 * std::log(a) - 1 / b / c + std::tan(M_PI * b * c);
double y = std::cos(0.387 * a) + std::sqrt(std::abs(a + b));
std::cout << "x = " << x << "\n" << "y = "<< y << std::endl;
std::cin >> a;
return 0;
}
Компилятор MinGW
