ShaysXIA/CodeInsightBench huggingface dataset:
Problem: 2049C - MEX Cycle
Language: C++17 (GCC 7-32)

Previous submission (verdict: Wrong answer on test 1):
 #include<bits/stdc++.h>

#define ll long long int

using namespace std;

int main(){

    ll t;

    cin>>t;

    while(t--){

        ll n,x,y;

        cin>>n>>x>>y;

        vector<ll>v(n,0);

        for(int i=0;i<=n-1;i++){

            if(i%2!=0) v[i]=1;

        }

        if(n%2==0 || (y-x)%2==0) v[x-1]=2;

        for(int i=0;i<=n-1;i++) cout<<v[i]<<" ";

        cout<<endl;

    }

    return 0;

}

Submission (verdict: Wrong answer on test 1):
 #include<bits/stdc++.h>

#define ll long long int

using namespace std;

int main(){

    ll t;

    cin>>t;

    while(t--){

        ll n,x,y;

        cin>>n>>x>>y;

        vector<ll>v(n,0);

        --x;

        --y;

        for(int i=0;i<=n-1;i++){

            v[(x+i)%n] = i%2;

        }

        if(n%2==0 || (y-x)%2==0) v[x]=2;

        for(int i=0;i<=n-1;i++) cout<<v[i]<<" ";

        cout<<endl;

    }

    return 0;

}
Problem: 2049C - MEX Cycle
Language: C++17 (GCC 7-32)

Previous submission (verdict: Wrong answer on test 1):
 #include<bits/stdc++.h>

#define ll long long int

using namespace std;

int main(){

    ll t;

    cin>>t;

    while(t--){

        ll n,x,y;

        cin>>n>>x>>y;

        vector<ll>v(n,0);

        --x;

        --y;

        for(int i=0;i<=n-1;i++){

            v[(x+i)%n] = i%2;

        }

        if(n%2==0 || (y-x)%2==0) v[x]=2;

        for(int i=0;i<=n-1;i++) cout<<v[i]<<" ";

        cout<<endl;

    }

    return 0;

}

Submission (verdict: Accepted):
 #include<bits/stdc++.h>

#define ll long long int

using namespace std;

int main(){

    ll t;

    cin>>t;

    while(t--){

        ll n,x,y;

        cin>>n>>x>>y;

        vector<ll>v(n,0);

        --x;

        --y;

        for(int i=0;i<=n-1;i++){

            v[(x+i)%n] = i%2;

        }   

        if(n%2 || (y-x) % 2==0) v[x]=2;

        for(int i=0;i<=n-1;i++) cout<<v[i]<<" ";

        cout<<endl;

    }

    return 0;

}
Problem: 2049C - MEX Cycle
Language: C++17 (GCC 7-32)

Previous submission (verdict: Wrong answer on test 1):
 #include<bits/stdc++.h>

#define ll long long int

using namespace std;

int main(){

    ll t;

    cin>>t;

    while(t--){

        ll n,x,y;

        cin>>n>>x>>y;

        vector<ll>v(n,0);

        for(int i=0;i<=n-1;i++){

            if(i%2!=0) v[i]=1;

        }

        if(n%2==0 || (y-x)%2==0) v[x]=2;

        for(int i=0;i<=n-1;i++) cout<<v[i]<<" ";

        cout<<endl;

    }

    return 0;

}

Submission (verdict: Wrong answer on test 1):
 #include<bits/stdc++.h>

#define ll long long int

using namespace std;

int main(){

    ll t;

    cin>>t;

    while(t--){

        ll n,x,y;

        cin>>n>>x>>y;

        vector<ll>v(n,0);

        for(int i=0;i<=n-1;i++){

            if(i%2!=0) v[i]=1;

        }

        if(n%2==0 || (y-x)%2==0) v[x-1]=2;

        for(int i=0;i<=n-1;i++) cout<<v[i]<<" ";

        cout<<endl;

    }

    return 0;

}
Problem: 2049C - MEX Cycle
Language: C++17 (GCC 7-32)

Previous submission (verdict: Wrong answer on test 1):
#include<bits/stdc++.h>

#define ll long long int

using namespace std;

int main(){

    ll t;

    cin>>t;

    while(t--){

        ll n,x,y;

        cin>>n>>x>>y;

        vector<ll>v(n,0);

        for(int i=0;i<=n-1;i++){

            if(i%2!=0) v[i]=1;

        }

        v[x-1]=2;

        ll a=v[0];

        ll b=v[n-2];

        for(int i=0;i<=2;i++){

            if(n!=x && n!=y)  if(i!=a && i!=b) v[n-1]=i;

        }

        for(int i=0;i<=n-1;i++) cout<<v[i]<<" ";

        cout<<endl;

    }

    return 0;

}

Submission (verdict: Wrong answer on test 1):
 #include<bits/stdc++.h>

#define ll long long int

using namespace std;

int main(){

    ll t;

    cin>>t;

    while(t--){

        ll n,x,y;

        cin>>n>>x>>y;

        vector<ll>v(n,0);

        for(int i=0;i<=n-1;i++){

            if(i%2!=0) v[i]=1;

        }

        if(n%2==0 || (y-x)%2==0) v[x]=2;

        for(int i=0;i<=n-1;i++) cout<<v[i]<<" ";

        cout<<endl;

    }

    return 0;

}
Problem: 2049C - MEX Cycle
Language: C++17 (GCC 7-32)


Submission (verdict: Wrong answer on test 1):
#include<bits/stdc++.h>

#define ll long long int

using namespace std;

int main(){

    ll t;

    cin>>t;

    while(t--){

        ll n,x,y;

        cin>>n>>x>>y;

        vector<ll>v(n,0);

        for(int i=0;i<=n-1;i++){

            if(i%2!=0) v[i]=1;

        }

        v[x-1]=2;

        ll a=v[0];

        ll b=v[n-2];

        for(int i=0;i<=2;i++){

            if(n!=x && n!=y)  if(i!=a && i!=b) v[n-1]=i;

        }

        for(int i=0;i<=n-1;i++) cout<<v[i]<<" ";

        cout<<endl;

    }

    return 0;

}
Problem: 2063C - Remove Exactly Two
Language: C++17 (GCC 7-32)


Submission (verdict: Wrong answer on test 2):
#include<bits/stdc++.h>
#define int long long
using namespace std;

bool comp(pair<int, int> a, pair<int, int> b) {
    return a.first > b.first;
}

void solve() {
    int n;
    cin >> n;
    vector<set<int>> adj(n);
    vector<pair<int, int>> deg(n, {0, 0});
    for(int i = 0; i < n-1; i++) {
        int u, v;
        cin >> u >> v;
        u--, v--;
        adj[u].insert(v);
        adj[v].insert(u);
        deg[u].first++;
        deg[u].second = u;
        deg[v].first++;
        deg[v].second = v;
    }

    sort(deg.begin(), deg.end(), comp);

    if(n == 2) {
        cout << "0\n";
        return;
    }

    if(deg[1].first > deg[2].first) {
        if(adj[deg[0].second].find(deg[1].second) != adj[deg[0].second].end()) {
            cout << deg[0].first + deg[0].first - 2 << endl;
            return;
        }
        cout << deg[0].first + deg[0].first - 1 << endl;
        return;
    }

    int ans = 0;
    if(adj[deg[0].second].find(deg[1].second) != adj[deg[0].second].end()) {
        ans = deg[0].first + deg[1].first - 2;
    } else {
        ans = deg[0].first + deg[1].first - 1;
    }

    int i = 2;
    while(i < n && deg[i].first == deg[1].first) {
        if(adj[deg[0].second].find(deg[i].second) != adj[deg[0].second].end()) {
            ans = max(ans, deg[0].first + deg[i].first - 2);
        } else {
            ans = max(ans, deg[0].first + deg[i].first - 1);
        }
        i++;
    }

    cout << ans << endl;
}

int32_t main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    int t = 1;
    cin >> t;
    while(t--) {
        solve();
    }
}
Problem: 2050D - Digital string maximization
Language: C++17 (GCC 7-32)

Previous submission (verdict: Runtime error on test 3):
#include "bits/stdc++.h"
using namespace std;

typedef long long ll;
#define fast_cin() ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL)

void solve() {
    long long n;
    cin >> n;
    string st = to_string(n);

    while (true) {
        int biggestDiff = INT_MIN;
        int ind = 0;

        if (st.size() == 1) {
            cout << n << endl;
            return;
        }

        for (int i = 1; i < st.size(); i++) {
            if (st[i] == '0') {
                continue;
            }
            if (isdigit(st[i]) && isdigit(st[i - 1])) {
                int diff = stoi(string(1, st[i])) - stoi(string(1, st[i - 1]));
                if (diff == 1) {
                    continue;
                }
                if (biggestDiff < diff && stoi(string(1, st[i])) > stoi(string(1, st[i - 1])) && diff > 0) {
                    biggestDiff = diff;
                    ind = i;
                }
            }
        }

        if (biggestDiff == INT_MIN) {
            break;
        }

        int store = stoll(st);
        swap(st[ind - 1], st[ind]);
        st[ind - 1]--;
        
        if (store > stoll(st)) {
            st = to_string(store);
            break;
        }
    }

    cout << st << endl;
    return;
}

int main() {
    fast_cin();
    ll t;
    cin >> t;
    for (int it = 1; it <= t; it++) {
        solve();
    }
    return 0;
}


Submission (verdict: Runtime error on test 3):
#include "bits/stdc++.h"
using namespace std;

typedef long long ll;
#define fast_cin() ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL)

void solve() {
    string st;
    cin>>st;

    while (true) {
        int biggestDiff = INT_MIN;
        int ind = 0;

        if (st.size() == 1) {
            cout << st << endl;
            return;
        }

        for (int i = 1; i < st.size(); i++) {
            if (st[i] == '0') {
                continue;
            }
            if (isdigit(st[i]) && isdigit(st[i - 1])) {
                int diff = stoi(string(1, st[i])) - stoi(string(1, st[i - 1]));
                if (diff == 1) {
                    continue;
                }
                if (biggestDiff < diff && stoi(string(1, st[i])) > stoi(string(1, st[i - 1])) && diff > 0) {
                    biggestDiff = diff;
                    ind = i;
                }
            }
        }

        if (biggestDiff == INT_MIN) {
            break;
        }

        int store = stoll(st);
        swap(st[ind - 1], st[ind]);
        st[ind - 1]--;
        
        if (store > stoll(st)) {
            st = to_string(store);
            break;
        }
    }

    cout << st << endl;
    return;
}

int main() {
    fast_cin();
    ll t;
    cin >> t;
    for (int it = 1; it <= t; it++) {
        solve();
    }
    return 0;
}
Problem: 2050D - Digital string maximization
Language: C++17 (GCC 7-32)


Submission (verdict: Runtime error on test 3):
#include "bits/stdc++.h"
#include <iostream>
#include <complex>
#include <queue>
#include <set>
#include <unordered_set>
#include <list>
#include <chrono>
#include <random>
#include <iostream>
#include <algorithm>
#include <cmath>
#include <string>
#include <vector>
#include <map>
#include <unordered_map>
#include <stack>
#include <iomanip>
#include <fstream>

using namespace std;

typedef long long ll;
typedef long double ld;
typedef pair<int,int> p32;
typedef pair<ll,ll> p64;
typedef pair<double,double> pdd;
typedef vector<ll> v64;
typedef vector<int> v32;
typedef vector<vector<int> > vv32;
typedef vector<vector<ll> > vv64;
typedef vector<vector<p64> > vvp64;
typedef vector<p64> vp64;
typedef vector<p32> vp32;
ll MOD = 998244353;
double eps = 1e-12;
#define forn(i,e) for(ll i = 0; i < e; i++)
#define forsn(i,s,e) for(ll i = s; i < e; i++)
#define rforn(i,s) for(ll i = s; i >= 0; i--)
#define rforsn(i,s,e) for(ll i = s; i >= e; i--)
#define ln "\n"
#define dbg(x) cout<<#x<<" = "<<x<<ln
#define mp make_pair
#define pb push_back
#define fi first
#define se second
#define INF 2e18
#define fast_cin() ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL)
#define all(x) (x).begin(), (x).end()
#define sz(x) ((ll)(x).size())


void solve(){
    long long n;
    cin>>n;
    string st = to_string(n);
    while(true){
        int biggestDiff = INT_MIN;
        int ind = 0;
        if(st.size()==1){
            cout<<n<<endl;
            return;
        }
        for(int i = 1; i<st.size();i++){
            if(st[i] == '0'){
                continue;
            }
            if (isdigit(st[i]) && isdigit(st[i - 1])) {
                int diff = stoll(string(1, st[i])) - stoll(string(1, st[i - 1]));
                if(diff == 1){
                    continue;
                }
                if (biggestDiff < diff && stoll(string(1, st[i])) > stoll(string(1, st[i - 1])) && diff>0) {
                    biggestDiff = diff;
                    ind = i;
                }
            }
        }
        if(biggestDiff == INT_MIN){
            break;
        }
        int store = stoll(st);
        swap(st[ind-1],st[ind]);
        st[ind-1]--;
        if(store>stoll(st)){
            st = to_string(store);
            break;
        }
    }
    cout<<st<<endl;
    return;
}
int main()
{
     fast_cin();
     ll t;
     cin >> t;
     for(int it=1;it<=t;it++) {
     //cout << "Case #" << it+1 << ": ";
        solve();
    }
    return 0;
}
Problem: 2063B - Subsequence Update
Language: C++17 (GCC 7-32)

Previous submission (verdict: Wrong answer on test 2):
#include <bits/stdc++.h>
using namespace std;

#define ll long long int
#define vi vector<int>
#define vll vector<ll>
#define vin(v) for(auto &i : v) cin >> i
#define vout(v) for(auto &i : v) cout << i << ' '; cout<<endl
#define yes cout << "YES" << endl
#define no cout << "NO" << endl
#define fr(x,y) for(ll i=x;i<y;i++)
#define gcd(a,b) __gcd(a,b)
#define lcm(a,b) (a*b)/__gcd(a,b)
#define pb push_back
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define pll pair<ll, ll>
#define endl '\n'
#define fastio() ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
const ll mod = 1e9 + 7;
// vector<bool> isPrime(N + 1, true);
// void sieve() {
//     isPrime[0] = isPrime[1] = false;
//     for (ll i = 2; i * i <= N; i++) {
//         if (isPrime[i]) {
//             for (ll j = i * i; j <= N; j += i)
//                 isPrime[j] = false;
//         }
//     }
// }

void solve () {
    ll n,l,r;
    cin >>n>>l>>r;
    vll v(n);
    vin(v);
    sort(all(v));
    ll ans=0;
    fr(0,(r-l+1)) {
        ans+=v[i];
    }
    cout<<ans<<endl;
}

int main() {
    fastio();
    int t;
    cin >>t;
    while(t--) {
        solve();
    }
}

Submission (verdict: Wrong answer on test 1):
#include <bits/stdc++.h>
using namespace std;

#define ll long long int
#define vi vector<int>
#define vll vector<ll>
#define vin(v) for(auto &i : v) cin >> i
#define vout(v) for(auto &i : v) cout << i << ' '; cout<<endl
#define yes cout << "YES" << endl
#define no cout << "NO" << endl
#define fr(x,y) for(ll i=x;i<y;i++)
#define gcd(a,b) __gcd(a,b)
#define lcm(a,b) (a*b)/__gcd(a,b)
#define pb push_back
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define pll pair<ll, ll>
#define endl '\n'
#define fastio() ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
const ll mod = 1e9 + 7;
// vector<bool> isPrime(N + 1, true);
// void sieve() {
//     isPrime[0] = isPrime[1] = false;
//     for (ll i = 2; i * i <= N; i++) {
//         if (isPrime[i]) {
//             for (ll j = i * i; j <= N; j += i)
//                 isPrime[j] = false;
//         }
//     }
// }

void solve () {
    ll n,l,r;   
    cin >>n>>l>>r;
    vll v(n);
    vin(v);
    sort(all(v));
    ll ans=0;
    vll v1;
    for(int i=l-1;i<n;i++) {
        v1.pb(v[i]);
    }
    vll v2;
    for(int i=0;i<r;i++) {
        v2.pb(v[i]);
    }
    sort(all(v1));
    sort(all(v2));
    ll ans1=0;
    for(int i=0;i<(r-l+1);i++) {
        ans1+=v2[i];
    }
    ll ans2=0;
    for(int i=0;i<(r-l+1);i++) {
        ans2+=v1[i];
    }
    ans=max(ans1,ans2);
    cout<<ans<<endl;
}

int main() {
    fastio();
    int t;
    cin >>t;
    while(t--) {
        solve();
    }
}
Problem: 2063B - Subsequence Update
Language: C++17 (GCC 7-32)

Previous submission (verdict: Wrong answer on test 1):
#include <bits/stdc++.h>
using namespace std;

#define ll long long int
#define vi vector<int>
#define vll vector<ll>
#define vin(v) for(auto &i : v) cin >> i
#define vout(v) for(auto &i : v) cout << i << ' '; cout<<endl
#define yes cout << "YES" << endl
#define no cout << "NO" << endl
#define fr(x,y) for(ll i=x;i<y;i++)
#define gcd(a,b) __gcd(a,b)
#define lcm(a,b) (a*b)/__gcd(a,b)
#define pb push_back
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define pll pair<ll, ll>
#define endl '\n'
#define fastio() ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
const ll mod = 1e9 + 7;
// vector<bool> isPrime(N + 1, true);
// void sieve() {
//     isPrime[0] = isPrime[1] = false;
//     for (ll i = 2; i * i <= N; i++) {
//         if (isPrime[i]) {
//             for (ll j = i * i; j <= N; j += i)
//                 isPrime[j] = false;
//         }
//     }
// }

void solve () {
    ll n,l,r;   
    cin >>n>>l>>r;
    vll v(n);
    vin(v);
    sort(all(v));
    ll ans=0;
    vll v1;
    for(int i=l-1;i<n;i++) {
        v1.pb(v[i]);
    }
    vll v2;
    for(int i=0;i<r;i++) {
        v2.pb(v[i]);
    }
    sort(all(v1));
    sort(all(v2));
    ll ans1=0;
    for(int i=0;i<(r-l+1);i++) {
        ans1+=v2[i];
    }
    ll ans2=0;
    for(int i=0;i<(r-l+1);i++) {
        ans2+=v1[i];
    }
    ans=max(ans1,ans2);
    cout<<ans<<endl;
}

int main() {
    fastio();
    int t;
    cin >>t;
    while(t--) {
        solve();
    }
}

Submission (verdict: Wrong answer on test 2):
#include <bits/stdc++.h>
using namespace std;

#define ll long long int
#define vi vector<int>
#define vll vector<ll>
#define vin(v) for(auto &i : v) cin >> i
#define vout(v) for(auto &i : v) cout << i << ' '; cout<<endl
#define yes cout << "YES" << endl
#define no cout << "NO" << endl
#define fr(x,y) for(ll i=x;i<y;i++)
#define gcd(a,b) __gcd(a,b)
#define lcm(a,b) (a*b)/__gcd(a,b)
#define pb push_back
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define pll pair<ll, ll>
#define endl '\n'
#define fastio() ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
const ll mod = 1e9 + 7;
// vector<bool> isPrime(N + 1, true);
// void sieve() {
//     isPrime[0] = isPrime[1] = false;
//     for (ll i = 2; i * i <= N; i++) {
//         if (isPrime[i]) {
//             for (ll j = i * i; j <= N; j += i)
//                 isPrime[j] = false;
//         }
//     }
// }

void solve () {
    ll n,l,r;   
    cin >>n>>l>>r;
    vll v(n);
    vin(v);
    sort(all(v));
    ll ans=0;
    vll v1;
    for(int i=l-1;i<n;i++) {
        v1.pb(v[i]);
    }
    vll v2;
    for(int i=0;i<r;i++) {
        v2.pb(v[i]);
    }
    sort(all(v1));
    sort(all(v2));
    ll ans1=0;
    for(int i=0;i<(r-l+1);i++) {
        ans1+=v2[i];
    }
    ll ans2=0;
    for(int i=0;i<(r-l+1);i++) {
        ans2+=v1[i];
    }
    ans=min(ans1,ans2);
    cout<<ans<<endl;
}

int main() {
    fastio();
    int t;
    cin >>t;
    while(t--) {
        solve();
    }
}
Problem: 2063B - Subsequence Update
Language: C++17 (GCC 7-32)

Previous submission (verdict: Wrong answer on test 2):
#include <bits/stdc++.h>
using namespace std;

#define ll long long int
#define vi vector<int>
#define vll vector<ll>
#define vin(v) for(auto &i : v) cin >> i
#define vout(v) for(auto &i : v) cout << i << ' '; cout<<endl
#define yes cout << "YES" << endl
#define no cout << "NO" << endl
#define fr(x,y) for(ll i=x;i<y;i++)
#define gcd(a,b) __gcd(a,b)
#define lcm(a,b) (a*b)/__gcd(a,b)
#define pb push_back
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define pll pair<ll, ll>
#define endl '\n'
#define fastio() ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
const ll mod = 1e9 + 7;
// vector<bool> isPrime(N + 1, true);
// void sieve() {
//     isPrime[0] = isPrime[1] = false;
//     for (ll i = 2; i * i <= N; i++) {
//         if (isPrime[i]) {
//             for (ll j = i * i; j <= N; j += i)
//                 isPrime[j] = false;
//         }
//     }
// }

void solve () {
    ll n,l,r;   
    cin >>n>>l>>r;
    vll v(n);
    vin(v);
    sort(all(v));
    ll ans=0;
    vll v1;
    for(int i=l-1;i<n;i++) {
        v1.pb(v[i]);
    }
    vll v2;
    for(int i=0;i<r;i++) {
        v2.pb(v[i]);
    }
    sort(all(v1));
    sort(all(v2));
    ll ans1=0;
    for(int i=0;i<(r-l+1);i++) {
        ans1+=v2[i];
    }
    ll ans2=0;
    for(int i=0;i<(r-l+1);i++) {
        ans2+=v1[i];
    }
    ans=min(ans1,ans2);
    cout<<ans<<endl;
}

int main() {
    fastio();
    int t;
    cin >>t;
    while(t--) {
        solve();
    }
}

Submission (verdict: Accepted):
#include <bits/stdc++.h>
using namespace std;

#define ll long long int
#define vi vector<int>
#define vll vector<ll>
#define vin(v) for(auto &i : v) cin >> i
#define vout(v) for(auto &i : v) cout << i << ' '; cout<<endl
#define yes cout << "YES" << endl
#define no cout << "NO" << endl
#define fr(x,y) for(ll i=x;i<y;i++)
#define gcd(a,b) __gcd(a,b)
#define lcm(a,b) (a*b)/__gcd(a,b)
#define pb push_back
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define pll pair<ll, ll>
#define endl '\n'
#define fastio() ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
const ll mod = 1e9 + 7;
// vector<bool> isPrime(N + 1, true);
// void sieve() {
//     isPrime[0] = isPrime[1] = false;
//     for (ll i = 2; i * i <= N; i++) {
//         if (isPrime[i]) {
//             for (ll j = i * i; j <= N; j += i)
//                 isPrime[j] = false;
//         }
//     }
// }

void solve () {
    ll n,l,r;   
    cin >>n>>l>>r;
    vll v(n);
    vin(v);
    ll ans=0;
    vll v1;
    for(int i=l-1;i<n;i++) {
        v1.pb(v[i]);
    }
    vll v2;
    for(int i=0;i<r;i++) {
        v2.pb(v[i]);
    }
    sort(all(v1));
    sort(all(v2));
    ll ans1=0;
    for(int i=0;i<(r-l+1);i++) {
        ans1+=v2[i];
    }
    ll ans2=0;
    for(int i=0;i<(r-l+1);i++) {
        ans2+=v1[i];
    }
    ans=min(ans1,ans2);
    cout<<ans<<endl;
}

int main() {
    fastio();
    int t;
    cin >>t;
    while(t--) {
        solve();
    }
}
Problem: 2063B - Subsequence Update
Language: C++17 (GCC 7-32)


Submission (verdict: Wrong answer on test 2):
#include <bits/stdc++.h>
using namespace std;

#define ll long long int
#define vi vector<int>
#define vll vector<ll>
#define vin(v) for(auto &i : v) cin >> i
#define vout(v) for(auto &i : v) cout << i << ' '; cout<<endl
#define yes cout << "YES" << endl
#define no cout << "NO" << endl
#define fr(x,y) for(ll i=x;i<y;i++)
#define gcd(a,b) __gcd(a,b)
#define lcm(a,b) (a*b)/__gcd(a,b)
#define pb push_back
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define pll pair<ll, ll>
#define endl '\n'
#define fastio() ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
const ll mod = 1e9 + 7;
// vector<bool> isPrime(N + 1, true);
// void sieve() {
//     isPrime[0] = isPrime[1] = false;
//     for (ll i = 2; i * i <= N; i++) {
//         if (isPrime[i]) {
//             for (ll j = i * i; j <= N; j += i)
//                 isPrime[j] = false;
//         }
//     }
// }

void solve () {
    ll n,l,r;
    cin >>n>>l>>r;
    vll v(n);
    vin(v);
    sort(all(v));
    ll ans=0;
    fr(0,(r-l+1)) {
        ans+=v[i];
    }
    cout<<ans<<endl;
}

int main() {
    fastio();
    int t;
    cin >>t;
    while(t--) {
        solve();
    }
}