QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#408131 | #6895. a-b Problem | xuzhihaodedie# | AC ✓ | 100ms | 5224kb | C++20 | 747b | 2024-05-09 18:53:05 | 2024-05-09 18:53:06 |
Judging History
answer
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define PII pair<int,int>
#define lson 2*p
#define rson 2*p+1
#define x first
#define y second
//#define endl "\n"
constexpr int N=1e6+10;
constexpr int mod=998244353;
int b[N],a[N];
struct node {
int a,b;
} f[N];
bool cmp(node a,node b) {
return a.a+a.b>b.a+b.b;
}
void solve() {
int n;
cin>>n;
for(int i=1;i<=n;i++) cin>>f[i].a>>f[i].b;
sort(f+1,f+n+1,cmp);
int ans=0;
for(int i=1;i<=n;i++) {
if(i&1) ans+=f[i].a;
else ans-=f[i].b;
}
cout<<ans<<endl;
}
signed main() {
ios::sync_with_stdio(false);
cin.tie(0);
int T=1;
cin>>T;
while(T--) {
solve();
}
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 100ms
memory: 5224kb
input:
20 3 0 2 1 2 3 3 3 1 0 2 3 0 4 4 2 8 1 14 10 2 10 6 2 1 3 3 4 2 4 8 6 2 2 0 0 10 10 2 5 0 2 1 2 4 5 6 2 3 4 2 10 9 3 8 3 6 1 3 4 4 0 3 10 3 7 3 2 10 3 1 9 8 1 0 0 4 1 2 15 8 11 8 10 2 4 9 3 5 14 10 5 2 12 4 7 6 7 6 12 11 2 15 100000 3 1 10 8 1 8 7 9 3 6 9 2 0 7 1 3 7 1 2 0 10 9 2 5 0 3 6 1 9 0 1 1 1...
output:
1 -1 -2 0 2 10 4 2 6 6 7 0 15 -1 -2 -697 -24972584309703 24978641064563 42097360102 -61290555356
result:
ok 20 lines