QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#793640#6525. New HousesBulonteWA 99ms3592kbC++232.3kb2024-11-29 21:59:112024-11-29 21:59:14

Judging History

This is the latest submission verdict.

  • [2024-11-29 21:59:14]
  • Judged
  • Verdict: WA
  • Time: 99ms
  • Memory: 3592kb
  • [2024-11-29 21:59:11]
  • Submitted

answer

#include<bits/stdc++.h>
using namespace std;
#define int long long

const int N = 5e5+5;
vector<pair<int,int>> neibor,noneibor;

bool cmp(pair<int,int> aa,pair<int,int> bb){return aa.second > bb.second;}

void solve()
{
    neibor.clear();noneibor.clear();
    int n,m;cin>>n>>m;
    for(int i = 1;i<=n;i++)
    {
        int a,b;cin>>a>>b;
        if(a >= b) neibor.push_back({a,b});
        else noneibor.push_back({a,b});
    }
    //cout<<neibor.size()<<" "<<noneibor.size()<<endl;
    if(n == 1)
    {
        if(!neibor.empty()){cout<<neibor[0].second;}
        else cout<<noneibor[0].second;
        return;
    }
    sort(noneibor.begin(),noneibor.end(),cmp);
    int ans = 0;
    int size = neibor.size();
    int end = m - size;
    int cnt = end - noneibor.size();

    if(cnt >= noneibor.size())
    {
        if(neibor.size() == 1)
        {
            int tmp = neibor[0].first + noneibor[0].first;
            ans = max(tmp,neibor[0].second + noneibor[0].second);
            for(int i = 1;i<noneibor.size();i++)
            {
                ans += noneibor[i].second;
            }
        }
        else
        {
            for(int i = 0;i<neibor.size();i++)
            {
                ans += neibor[i].first;
            }
            for(int i = 0;i<noneibor.size();i++)
            {
                ans += noneibor[i].second;
            }
        }
    }
    else
    {
        for(int i = cnt;i<noneibor.size();i++)
        {
            neibor.push_back(noneibor[i]);
        }
        if(neibor.size() == 1)
        {
            int tmp = neibor[0].first + noneibor[0].first;
            ans = max(tmp,neibor[0].second + noneibor[0].second);
            for(int i = 1;i<cnt;i++)
            {
                ans += noneibor[i].second;
            }
        }
        else
        {
            for(int i = 0;i<neibor.size();i++)
            {
                ans += neibor[i].first;
            }
            for(int i = 0;i<cnt;i++)
            {
                ans += noneibor[i].second;
            }
        }
    }
    cout<<ans<<endl;
}

signed main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);cout.tie(0);
    int T;cin>>T;
    while(T--) solve();
    return 0;
}



Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100
Accepted
time: 0ms
memory: 3568kb

input:

3
4 5
1 100
100 1
100 1
100 1
2 2
1 10
1 10
2 3
100 50
1 1000

output:

400
2
1050

result:

ok 3 number(s): "400 2 1050"

Test #2:

score: -100
Wrong Answer
time: 99ms
memory: 3592kb

input:

100000
6 11
191141536 365120521
799679686 648574232
102602909 467685128
405440859 796808887
384858152 191995380
433392826 195648471
5 13
831367906 510447872
795639287 575551283
811207605 176441088
240156289 946977042
133416463 721098873
5 5
806744021 699586200
630510306 637827160
49223781 641709297
...

output:

3247545200
4106290713
2653993029
5122532137
5570513606
2031887824
2044500908
1857678917
6815058419
2237593918
6646615756
5638337819
3690874076
5497726904
5513905900
5404435094
4705403467
2411992217
3430587752
5098767681
3921151709
1271949960
2692878616
3833748807
2409784919
9744855736464787173
88398...

result:

wrong answer 22nd numbers differ - expected: '1445672728', found: '1271949960'