Submission #1791159
Source Code Expand
#include<iostream> using namespace std; int main(){ int N,A; long long int K; long long int Wa=0; long long int ans; int a[100000]; int b[100000]; int i,j; cin>>N>>K; for(i=0;i<N;i++){ cin>>a[i]>>b[i]; } for(i=0;i<N;i++){ for(j=0;j<N-i-1;j++){ if(a[j]>a[j+1]){ A=a[j]; a[j]=a[j+1]; a[j+1]=A; A=b[j]; b[j]=b[j+1]; b[j+1]=A; } } } for(i=0;i<N;i++){ Wa=Wa+b[i]; if(K<=Wa){ ans=a[i]; break; } } cout<<ans<<endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | C - Big Array |
User | motsu8mgn |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 541 Byte |
Status | TLE |
Exec Time | 2103 ms |
Memory | 1024 KB |
Judge Result
Set Name | Sample | All | ||||||
---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 0 / 300 | ||||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | sample_01.txt, sample_02.txt |
All | sample_01.txt, sample_02.txt, subtask_1_1.txt, subtask_1_10.txt, subtask_1_11.txt, subtask_1_12.txt, subtask_1_13.txt, subtask_1_14.txt, subtask_1_15.txt, subtask_1_2.txt, subtask_1_3.txt, subtask_1_4.txt, subtask_1_5.txt, subtask_1_6.txt, subtask_1_7.txt, subtask_1_8.txt, subtask_1_9.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
sample_01.txt | AC | 1 ms | 256 KB |
sample_02.txt | AC | 1 ms | 256 KB |
subtask_1_1.txt | AC | 2 ms | 256 KB |
subtask_1_10.txt | TLE | 2103 ms | 1024 KB |
subtask_1_11.txt | TLE | 2103 ms | 1024 KB |
subtask_1_12.txt | TLE | 2103 ms | 1024 KB |
subtask_1_13.txt | TLE | 2103 ms | 1024 KB |
subtask_1_14.txt | TLE | 2103 ms | 1024 KB |
subtask_1_15.txt | TLE | 2103 ms | 1024 KB |
subtask_1_2.txt | AC | 29 ms | 256 KB |
subtask_1_3.txt | AC | 1661 ms | 512 KB |
subtask_1_4.txt | TLE | 2103 ms | 768 KB |
subtask_1_5.txt | TLE | 2103 ms | 1024 KB |
subtask_1_6.txt | AC | 1 ms | 256 KB |
subtask_1_7.txt | AC | 2 ms | 256 KB |
subtask_1_8.txt | AC | 68 ms | 256 KB |
subtask_1_9.txt | TLE | 2103 ms | 512 KB |