Submission #2403926
Source Code Expand
#include <iostream> #include <cstdio> #include <algorithm> using namespace std; typedef long long int lli; const lli maxn = lli(2e5)+5; pair<lli, lli> A[maxn]; int main(void) { lli n, res1 = 0, res2 = 0, res3 = 0, alleq = 0; scanf("%lld", &n); for(lli i = 0;i < n;i++) { scanf("%lld%lld", &A[i].first, &A[i].second); alleq = max(alleq, lli(A[i].first != A[i].second)); } if(!alleq) { printf("0\n"); return 0; } for(lli i = 0;i < n;i++) { if(A[i].first <= A[i].second) res1 += A[i].first; } for(lli i = 0;i < n;i++) { if(A[i].first > A[i].second) res2 += A[i].first; } for(lli i = 0;i < n;i++) { if(A[i].first > A[i].second) res3 = max(res3, res2-A[i].second); } printf("%lld\n", res1+res3); }
Submission Info
Submission Time | |
---|---|
Task | E - Tozan and Gezan |
User | NibNalin |
Language | C++14 (GCC 5.4.1) |
Score | 700 |
Code Size | 776 Byte |
Status | AC |
Exec Time | 5 ms |
Memory | 512 KB |
Compile Error
./Main.cpp: In function ‘int main()’: ./Main.cpp:15:19: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] scanf("%lld", &n); ^ ./Main.cpp:18:47: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] scanf("%lld%lld", &A[i].first, &A[i].second); ^
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 700 / 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 | AC | 5 ms | 512 KB |
02.txt | AC | 5 ms | 512 KB |
03.txt | AC | 5 ms | 512 KB |
04.txt | AC | 5 ms | 512 KB |
05.txt | AC | 5 ms | 512 KB |
06.txt | AC | 5 ms | 512 KB |
07.txt | AC | 5 ms | 512 KB |
08.txt | AC | 5 ms | 512 KB |
09.txt | AC | 5 ms | 512 KB |
10.txt | AC | 5 ms | 512 KB |
11.txt | AC | 5 ms | 512 KB |
12.txt | AC | 5 ms | 512 KB |
13.txt | AC | 5 ms | 512 KB |
14.txt | AC | 5 ms | 512 KB |
15.txt | AC | 5 ms | 512 KB |
16.txt | AC | 5 ms | 512 KB |
17.txt | AC | 5 ms | 512 KB |
18.txt | AC | 5 ms | 512 KB |
19.txt | AC | 5 ms | 512 KB |
20.txt | AC | 5 ms | 512 KB |
21.txt | AC | 5 ms | 512 KB |
22.txt | AC | 5 ms | 512 KB |
23.txt | AC | 5 ms | 512 KB |
24.txt | AC | 5 ms | 512 KB |
25.txt | AC | 5 ms | 512 KB |
26.txt | AC | 5 ms | 512 KB |
27.txt | AC | 5 ms | 512 KB |
28.txt | AC | 5 ms | 512 KB |
29.txt | AC | 5 ms | 512 KB |
30.txt | AC | 5 ms | 512 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 |