1575A - Another Sorting Problem - CodeForces Solution

#include <iostream>
#include <algorithm>
#include <vector>
#include <iostream>
#include <algorithm>
#include <vector>
using namespace std;
typedef long long int ll;
int main() 
{
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    ll n,m;
    cin>>n>>m;
    vector<pair<string, int>> s(n);
    for(int i = 0; i < n; i++){
        cin >> s[i].first;
        s[i].second = i + 1;
    }
    for(int i = 0; i < n; i++){
        for(int j = 1; j < m; j += 2){
            s[i].first[j] = 'Z' - s[i].first[j];
        }
    }
    sort(s.begin(),s.end());
 
    for(auto x : s){
        cout << x.second << " ";
    } 
    cout << endl; 
}