Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- #include <vector>
- using namespace std;
- typedef pair<int, int> perechi;
- vector < perechi > v;
- int main() {
- int x, n, k, i;
- cin >> n >> k;
- for(i = 0; i < n; i++) {
- cin >> x;
- v.push_back( make_pair(x, 0) );
- for(int j = 0; j < i; j++) {
- if(v[i].first < v[j].first) v[j].second++;
- else if(v[j].first < v[i].first) v[i].second++;
- }
- }
- int a, b;
- for(i = 0; i < k; i++) {
- cin >> a >> b;
- a--;
- b--;
- if(v[a].first < v[b].first) v[b].second--;
- else if( v[a].first > v[b].first ) v[a].second--;
- }
- for(i = 0; i < n; i++) {
- cout << v[i].second << " ";
- }
- //sort(v.begin(), v.end(), comparator);
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement