Submission #3225427
Source Code Expand
#include <cassert> #include <cstdio> #include <cstring> #include <algorithm> #include <iostream> #define REP(i, n) for(int i = 0; i < (int)(n); ++i) using namespace std; typedef long long ll; struct P { int a, b; }; P ps[200000+10]; bool operator<(const P& p1, const P& p2) { if((p1.b-p1.a) != (p2.b-p2.a)) { return (p1.b-p1.a) > (p2.b-p2.a); } else { return p1.b > p2.b; } } int main(void) { int n; scanf("%d", &n); REP(i, n) { scanf("%d%d", &ps[i].a, &ps[i].b); } sort(ps, ps+n); // REP(i, n) { // cerr << ps[i].a << " " << ps[i].b << endl; // } ll a = 0; ll b = 0; REP(i, n) { const P& p = ps[i]; ll lead = b-a; if(p.a - lead < p.b) { a += p.a; b += p.b; } } cout << b << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | E - Tozan and Gezan |
User | ush |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 821 Byte |
Status | WA |
Exec Time | 7 ms |
Memory | 384 KB |
Compile Error
./Main.cpp: In function ‘int main()’: ./Main.cpp:24:18: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] scanf("%d", &n); ^ ./Main.cpp:26:38: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] scanf("%d%d", &ps[i].a, &ps[i].b); ^
Judge Result
Set Name | Sample | All | ||||||
---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 0 / 700 | ||||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | s1.txt, s2.txt, s3.txt |
All | 01.txt, 02.txt, 03.txt, 04.txt, 05.txt, 06.txt, 07.txt, 08.txt, 09.txt, 10.txt, 11.txt, 12.txt, 13.txt, 14.txt, 15.txt, 16.txt, 17.txt, 18.txt, 19.txt, 20.txt, 21.txt, 22.txt, 23.txt, 24.txt, 25.txt, 26.txt, 27.txt, 28.txt, 29.txt, 30.txt, 31.txt, 32.txt, s1.txt, s2.txt, s3.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
01.txt | WA | 7 ms | 384 KB |
02.txt | WA | 7 ms | 384 KB |
03.txt | WA | 7 ms | 384 KB |
04.txt | WA | 7 ms | 384 KB |
05.txt | WA | 7 ms | 384 KB |
06.txt | WA | 7 ms | 384 KB |
07.txt | WA | 7 ms | 384 KB |
08.txt | WA | 7 ms | 384 KB |
09.txt | WA | 7 ms | 384 KB |
10.txt | WA | 7 ms | 384 KB |
11.txt | AC | 7 ms | 384 KB |
12.txt | AC | 6 ms | 384 KB |
13.txt | AC | 6 ms | 384 KB |
14.txt | AC | 6 ms | 384 KB |
15.txt | AC | 6 ms | 384 KB |
16.txt | AC | 6 ms | 384 KB |
17.txt | AC | 6 ms | 384 KB |
18.txt | AC | 6 ms | 384 KB |
19.txt | WA | 7 ms | 384 KB |
20.txt | WA | 7 ms | 384 KB |
21.txt | WA | 7 ms | 384 KB |
22.txt | WA | 7 ms | 384 KB |
23.txt | WA | 7 ms | 384 KB |
24.txt | WA | 7 ms | 384 KB |
25.txt | WA | 7 ms | 384 KB |
26.txt | WA | 7 ms | 384 KB |
27.txt | WA | 6 ms | 384 KB |
28.txt | WA | 6 ms | 384 KB |
29.txt | WA | 6 ms | 384 KB |
30.txt | WA | 6 ms | 384 KB |
31.txt | AC | 1 ms | 256 KB |
32.txt | AC | 1 ms | 256 KB |
s1.txt | AC | 1 ms | 256 KB |
s2.txt | AC | 1 ms | 256 KB |
s3.txt | AC | 1 ms | 256 KB |