hdu5265二分

import java.io.BufferedInputStream;
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.io.OutputStreamWriter;
import java.io.PrintWriter;
import java.io.StreamTokenizer;
import java.math.BigInteger;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Comparator;
import java.util.HashMap;
import java.util.LinkedList;
import java.util.PriorityQueue;
import java.util.Queue;
import java.util.Scanner;
import java.util.Stack;
import java.util.StringTokenizer;

public class Main {

        public static void main(String[] args) throws IOException{
                StreamTokenizer cin = new StreamTokenizer(new BufferedInputStream(System.in)); 
                InputReader in = new InputReader(System.in)  ;
                PrintWriter out = new PrintWriter(System.out) ;

                while(cin.nextToken() != cin.TT_EOF){
                          new Task().solve((int)cin.nval , cin , out)  ;
                }

                out.flush() ; 
        }

}

class Task{

      long[]  a ; 

      public void solve(int n , StreamTokenizer cin , PrintWriter out) throws IOException{
                   a = new long[n] ;
                   cin.nextToken() ; long p = (long)cin.nval  ;
                   for(int i = 0 ; i < n ; i++){
                          cin.nextToken() ;  a[i] = (long)cin.nval  ;
                          a[i] %= p ;
                   }  

                   Arrays.sort(a) ;

                   long res = (a[n-2] + a[n-1]) % p ;
                   for(int i = 0 ; i < n ; i++){
                          int l = 0 ,  r = n-1  , mid ;
                          while(l <= r){
                                  mid = (l + r) >> 1 ;
                                  long sum = a[i] + a[mid] ; 
                                  if(sum < p){
                                         if(mid != i && sum > res)
                                                res = sum ;
                                         l = mid + 1  ;
                                    }
                                   else r = mid - 1 ;
                          }
                   }
                   out.println(res) ;

               //   out.flush(); 
      }

}




class InputReader{
    public BufferedReader reader;
    public StringTokenizer tokenizer;

    public InputReader(InputStream stream){
           reader = new BufferedReader(new InputStreamReader(stream), 32768);
           tokenizer = null;
    }

    public String next(){
        while(tokenizer == null || !tokenizer.hasMoreTokens()){
            try{
                tokenizer = new StringTokenizer(reader.readLine());
            }catch (IOException e) {
                throw new RuntimeException(e);
            }
        }
        return tokenizer.nextToken();
    }

    public int nextInt() {
        return Integer.parseInt(next());
    }

    public long nextLong() {
        return Long.parseLong(next());
    }

}
  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值