Submission #1532087
Source Code Expand
#include <cstdio>
#include <cstring>
#include <cmath>
#include <map>
#include <stack>
#include <algorithm>
using namespace std;
const int Max = 1e5;
long long n, k, sum = 0;
struct Num{
long long x, y;
}a[Max + 5];
bool cmp(Num p, Num q){
return p.x < q.x;
}
int main()
{
scanf ("%lld %lld", &n, &k);
for (int i = 1; i <= n; i++) scanf ("%lld %lld", &a[i].x, &a[i].y);
sort(a + 1, a + n + 1, cmp);
for (int i = 1; i <= n; i++){
sum += a[i].y;
if (sum < k) continue;
else if (sum >= k){
printf ("%lld\n", a[i].x);
return 0;
}
}
}
Submission Info
Submission Time
2017-08-21 22:13:09+0900
Task
C - Big Array
User
NiEnIe
Language
C++14 (GCC 5.4.1)
Score
300
Code Size
583 Byte
Status
AC
Exec Time
27 ms
Memory
1664 KB
Compile Error
./Main.cpp: In function ‘int main()’:
./Main.cpp:21:29: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf ("%lld %lld", &n, &k);
^
./Main.cpp:22:68: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
for (int i = 1; i <= n; i++) scanf ("%lld %lld", &a[i].x, &a[i].y);
^
Judge Result
Set Name
Sample
All
Score / Max Score
0 / 0
300 / 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
128 KB
sample_02.txt
AC
1 ms
128 KB
subtask_1_1.txt
AC
1 ms
128 KB
subtask_1_10.txt
AC
27 ms
1664 KB
subtask_1_11.txt
AC
26 ms
1664 KB
subtask_1_12.txt
AC
24 ms
1664 KB
subtask_1_13.txt
AC
22 ms
1664 KB
subtask_1_14.txt
AC
22 ms
1664 KB
subtask_1_15.txt
AC
22 ms
1664 KB
subtask_1_2.txt
AC
2 ms
256 KB
subtask_1_3.txt
AC
9 ms
640 KB
subtask_1_4.txt
AC
17 ms
1152 KB
subtask_1_5.txt
AC
26 ms
1664 KB
subtask_1_6.txt
AC
1 ms
128 KB
subtask_1_7.txt
AC
1 ms
128 KB
subtask_1_8.txt
AC
2 ms
256 KB
subtask_1_9.txt
AC
11 ms
768 KB