Submission #6059108
Source Code Expand
Copy
#include<bits/stdc++.h> #define REP(x,y,z) for(int x=y;x<=z;x++) #define MSET(x,y) memset(x,y,sizeof(x)) #define M 200005 using namespace std; using P = pair<int,int>; int n; P in[M]; int main() { while (~scanf("%d", &n)) { REP(i,1,n) scanf("%d %d",&in[i].second,&in[i].first); sort(in+1, in+n+1); int cur = 0; bool flg = false; REP(i,1,n) { cur += in[i].second; if (cur > in[i].first) flg = true; } puts(flg ? "No" : "Yes"); } return 0; }
Submission Info
Submission Time | |
---|---|
Task | D - Megalomania |
User | moffa |
Language | C++14 (GCC 5.4.1) |
Score | 400 |
Code Size | 557 Byte |
Status | AC |
Exec Time | 52 ms |
Memory | 1792 KB |
Compile Error
./Main.cpp: In function ‘int main()’: ./Main.cpp:12:61: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] REP(i,1,n) scanf("%d %d",&in[i].second,&in[i].first); ^
Judge Result
Set Name | Sample | Subtask1 | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 400 / 400 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | sample_01.txt, sample_02.txt, sample_03.txt |
Subtask1 | sample_01.txt, sample_02.txt, sample_03.txt, sub1_01.txt, sub1_02.txt, sub1_03.txt, sub1_04.txt, sub1_05.txt, sub1_06.txt, sub1_07.txt, sub1_08.txt, sub1_09.txt, sub1_10.txt, sub1_11.txt, sub1_12.txt, sub1_13.txt, sub1_14.txt, sub1_15.txt, sub1_16.txt, sub1_17.txt, sub1_18.txt, sub1_19.txt, sub1_20.txt, sub1_21.txt, sub1_22.txt, sub1_23.txt, sub1_24.txt, sub1_25.txt, sub1_26.txt, sub1_27.txt, sub1_28.txt, sub1_29.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
sample_01.txt | AC | 1 ms | 256 KB |
sample_02.txt | AC | 1 ms | 256 KB |
sample_03.txt | AC | 1 ms | 256 KB |
sub1_01.txt | AC | 1 ms | 256 KB |
sub1_02.txt | AC | 50 ms | 1792 KB |
sub1_03.txt | AC | 19 ms | 768 KB |
sub1_04.txt | AC | 50 ms | 1792 KB |
sub1_05.txt | AC | 1 ms | 256 KB |
sub1_06.txt | AC | 1 ms | 256 KB |
sub1_07.txt | AC | 48 ms | 1792 KB |
sub1_08.txt | AC | 48 ms | 1792 KB |
sub1_09.txt | AC | 1 ms | 256 KB |
sub1_10.txt | AC | 50 ms | 1792 KB |
sub1_11.txt | AC | 50 ms | 1792 KB |
sub1_12.txt | AC | 2 ms | 256 KB |
sub1_13.txt | AC | 2 ms | 256 KB |
sub1_14.txt | AC | 30 ms | 1152 KB |
sub1_15.txt | AC | 8 ms | 512 KB |
sub1_16.txt | AC | 52 ms | 1792 KB |
sub1_17.txt | AC | 6 ms | 384 KB |
sub1_18.txt | AC | 6 ms | 384 KB |
sub1_19.txt | AC | 2 ms | 256 KB |
sub1_20.txt | AC | 50 ms | 1792 KB |
sub1_21.txt | AC | 49 ms | 1792 KB |
sub1_22.txt | AC | 50 ms | 1792 KB |
sub1_23.txt | AC | 10 ms | 512 KB |
sub1_24.txt | AC | 1 ms | 256 KB |
sub1_25.txt | AC | 1 ms | 256 KB |
sub1_26.txt | AC | 1 ms | 256 KB |
sub1_27.txt | AC | 2 ms | 256 KB |
sub1_28.txt | AC | 49 ms | 1792 KB |
sub1_29.txt | AC | 49 ms | 1792 KB |