QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #141322 | #6525. New Houses | cy1999 | WA | 345ms | 3620kb | C++20 | 730b | 2023-08-17 10:45:07 | 2023-08-17 10:45:09 |
Judging History
answer
#include<iostream>
#include<algorithm>
#define int long long
using namespace std;
const int N=5e5+10;
int t,n,m,ans;
struct node{
int a,b;
}s[N];
bool cmp(node a,node b){
return a.b-a.a>b.b-b.a;
}
signed main(){
cin>>t;
while(t--){
cin>>n>>m;
for(int i=1;i<=n;i++)
cin>>s[i].a>>s[i].b;
sort(s+1,s+1+n,cmp);
int mid=1;
while(mid<=n&&s[mid].b>s[mid].a)mid++;
mid--;
int tmp=m-mid*2ll-(n-mid);
mid-=max(0ll,0-tmp);
if(mid==n-1)
if(s[n].a+s[n-1].a>s[n].b+s[n-1].b)
mid--;
ans=0;
for(int i=1;i<=mid;i++)
ans+=s[i].b;
for(int i=mid+1;i<=n;i++)
if(n>mid+1)
ans+=s[i].a;
else
ans+=s[i].b;
cout<<ans<<endl;
}
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 1ms
memory: 3620kb
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: 345ms
memory: 3408kb
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 1445672728 2692878616 3833748807 2716183054 974485573 6464787173 8839...
result:
wrong answer 51st numbers differ - expected: '755018141', found: '956338726'