QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #141374 | #6525. New Houses | cy1999 | WA | 393ms | 3452kb | C++17 | 754b | 2023-08-17 11:14:07 | 2023-08-17 11:14:08 |
Judging History
answer
#include<bits/stdc++.h>
using namespace std;
#define ll long long
ll n,m,cnt;
ll ans;
bool vis[1000100];
struct P{
ll a,b,c;
bool f;
bool operator<(const P x)const{
if(c==x.c) return b>x.b;
return c>x.c;
}
}p[1000100];
int main(){
int t;cin>>t;
while(t--){
cin>>n>>m;ans=0;cnt=0;
for(int i=1;i<=n;i++){
ll x,y;cin>>x>>y;
p[i]=(P){x,y,y-x,0};
ans+=x;
}
if(n==1||m==n){
cout<<ans<<endl;
continue;
}
sort(p+1,p+1+n);
// cnt=m-n;
for(int i=1;i<=n;i++){
if(p[i].c>0&&cnt+1<=m-n){
ans+=p[i].c;
cnt++;
p[i].f=1;
}
}
if(n-cnt==1){
for(int i=1;i<=n;i++){
if(!p[i].f) ans=ans-p[i].a+p[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: 3452kb
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: 393ms
memory: 3452kb
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 1345295010 6815058419 2237593918 6646615756 5638337819 3690874076 5497726904 5513905900 5404435094 4705403467 2411992217 3430587752 5098767681 3921151709 1271949960 2692878616 3833748807 2409784919 850381192 6464787173 8839...
result:
wrong answer 8th numbers differ - expected: '1857678917', found: '1345295010'