Submission #510071


Source Code Expand

#include<cstdio>
#include<cstring>
#include<cctype>
#include<cmath>
#include<climits>
#include<algorithm>
#include<vector>
#include<valarray>
#include<string>
#include<set>
#include<map>
#include<stack>
#include<queue>
using namespace std;
  
  
#define rep(i,n) for(int i=0;i<n;i++)
#define REP(i,n) for(int i=1;i<=n;i++)
#define drep(i,n) for(int i=n-1;i>=0;i--)
#define DREP(i,n) for(int i=n;i>0;i--)
#define Rep(i,m,n) for(int i=m;i<n;i++)
#define scani(a) scanf("%d",&a)
#define scand(a) scanf("%lf",&a)
#define scans(s) scanf("%s",s)
#define readi(a) int a;scanf("%d",&a)
#define printi(a) printf("%d",a)
#define prints(s) printf("%s",s)
#define even(n) (((n)+1)%2)
#define odd(n) ((n)%2)
#define sg(x) ((x)?1:0)
#define LF printf("\n")
#define SPACE printf(" ")
#define pb push_back
#define mp make_pair
#define bs binary_search
#define all(a) (a).begin(),(a).end()
#define MOD 100000007
  
typedef long long LL;
typedef vector<int> vi;
typedef vector<vector<int> > vvi;
typedef pair<double,double> pdd;
typedef pair<int,int> pii;
  
const double pi=acos(-1.0);
double rad(double t){return t*pi/180.0;}
double deg(double d){return d*180.0/pi;}
int GCD(int x,int y){if(x<y)swap(x,y);return x%y?GCD(y,x%y):y;}
int LCM(int x,int y){return x/GCD(x,y)*y;}


int main(){
  readi(N);
  readi(T);
  T=-T;

  vi times;

  rep(i,N){
    readi(A);readi(B);
    T+= A;
    times.pb(A-B);
  }

  sort(all(times));

  int i;

  if(T<=0)printf("0\n");
  else{
    for(i=1;i<=N;i++){
      //printf("times[%d]=%d\n",N-i,times[N-1]);
      T -= times[N-i];
      if(T<=0)break;
    }

    if(T>0)printf("-1\n");
    else printf("%d\n",i);
  }

  return 0;
}

Submission Info

Submission Time
Task C - 8月31日
User buko1062000
Language C++ (GCC 4.9.2)
Score 100
Code Size 1730 Byte
Status AC
Exec Time 75 ms
Memory 1444 KiB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:53:11: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   readi(N);
           ^
./Main.cpp:54:11: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   readi(T);
           ^
./Main.cpp:60:13: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
     readi(A);readi(B);
             ^
./Main.cpp:60:22: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
     readi(A);readi(B);
                      ^

Judge Result

Set Name Sample Dataset1 Dataset2
Score / Max Score 0 / 0 30 / 30 70 / 70
Status
AC × 5
AC × 15
AC × 36
Set Name Test Cases
Sample sample-01.txt, sample-02.txt, sample-03.txt, sample-04.txt, sample-05.txt
Dataset1 sample-01, sample-02, 01-01.txt, 01-02.txt, 01-03.txt, 01-04.txt, 01-05.txt, 01-06.txt, 01-07.txt, 01-08.txt, 01-09.txt, 01-10.txt, 01-11.txt, 01-12.txt, 01-13.txt, 01-14.txt, 01-15.txt
Dataset2 sample-01.txt, sample-02.txt, sample-03.txt, sample-04.txt, sample-05.txt, 01-01.txt, 01-02.txt, 01-03.txt, 01-04.txt, 01-05.txt, 01-06.txt, 01-07.txt, 01-08.txt, 01-09.txt, 01-10.txt, 01-11.txt, 01-12.txt, 01-13.txt, 01-14.txt, 01-15.txt, 02-01.txt, 02-02.txt, 02-03.txt, 02-04.txt, 02-05.txt, 02-06.txt, 02-07.txt, 02-08.txt, 02-09.txt, 02-10.txt, 02-11.txt, 02-12.txt, 02-13.txt, 02-14.txt, 02-15.txt, 02-16.txt
Case Name Status Exec Time Memory
01-01.txt AC 26 ms 796 KiB
01-02.txt AC 24 ms 676 KiB
01-03.txt AC 25 ms 672 KiB
01-04.txt AC 27 ms 796 KiB
01-05.txt AC 26 ms 924 KiB
01-06.txt AC 64 ms 1436 KiB
01-07.txt AC 75 ms 1436 KiB
01-08.txt AC 61 ms 1436 KiB
01-09.txt AC 34 ms 924 KiB
01-10.txt AC 48 ms 1236 KiB
01-11.txt AC 67 ms 1444 KiB
01-12.txt AC 62 ms 1444 KiB
01-13.txt AC 66 ms 1428 KiB
01-14.txt AC 54 ms 1436 KiB
01-15.txt AC 59 ms 1312 KiB
02-01.txt AC 26 ms 672 KiB
02-02.txt AC 25 ms 800 KiB
02-03.txt AC 25 ms 924 KiB
02-04.txt AC 26 ms 920 KiB
02-05.txt AC 29 ms 924 KiB
02-06.txt AC 64 ms 1436 KiB
02-07.txt AC 67 ms 1440 KiB
02-08.txt AC 67 ms 1364 KiB
02-09.txt AC 63 ms 1440 KiB
02-10.txt AC 65 ms 1436 KiB
02-11.txt AC 31 ms 804 KiB
02-12.txt AC 66 ms 1444 KiB
02-13.txt AC 67 ms 1436 KiB
02-14.txt AC 61 ms 1316 KiB
02-15.txt AC 57 ms 1440 KiB
02-16.txt AC 58 ms 1444 KiB
sample-01.txt AC 25 ms 804 KiB
sample-02.txt AC 25 ms 672 KiB
sample-03.txt AC 25 ms 800 KiB
sample-04.txt AC 26 ms 792 KiB
sample-05.txt AC 26 ms 920 KiB