Java-类实现结构体、pair

1、按照x关键字递增排序(y没有要求)

import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.OutputStreamWriter;
import java.io.PrintWriter;
import java.math.BigInteger;
import java.text.ParseException;
import java.util.*;

public class Main
{
    static PrintWriter pw = new PrintWriter(new BufferedWriter(new OutputStreamWriter(System.out)));
    static int N = (int)3000 + 10;
    static PII a[] = new PII[N];
    static Mycomparator cmp = new Mycomparator();

    public static void main(String[] args ) throws IOException, ParseException
    {
        int n = rd.nextInt();
        for(int i = 1; i <= n ; i ++)
        {
            int x = rd.nextInt();
            int y = rd.nextInt();
            a[i] = new PII(x,y);
        }

        Arrays.sort(a,1,n + 1,cmp);

        for(int i = 1 ; i <= n ; i ++)  pw.println(a[i].x + " " + a[i].y);
        pw.flush();
    }
}

class rd
{
    static BufferedReader reader = new BufferedReader(new InputStreamReader(System.in));
    static StringTokenizer tokenizer = new StringTokenizer("");

    static String nextLine() throws IOException  { return reader.readLine(); }

    static String next() throws IOException
    {
        while (!tokenizer.hasMoreTokens())  tokenizer = new StringTokenizer(reader.readLine());
        return tokenizer.nextToken();
    }

    static int nextInt() throws IOException  { return Integer.parseInt(next()); }

    static double nextDouble() throws IOException { return Double.parseDouble(next()); }

    static long nextLong() throws IOException  { return Long.parseLong(next());}

    static BigInteger nextBigInteger() throws IOException { return new BigInteger(rd.nextLine()); }
}

class PII
{
    int x,y;

    public PII(int x, int y)
    {
        this.x = x;
        this.y = y;
    }
}

// 手写cmp,万能,结构体里根本不用写接口
class Mycomparator implements Comparator<PII>
{
    @Override
    public int compare(PII o1, PII o2)
    {
        return o1.x - o2.x; //  x不同,按x递增排序
    }
}

2、按照x关键字递增排序(要求y也递增)

import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.OutputStreamWriter;
import java.io.PrintWriter;
import java.math.BigInteger;
import java.text.ParseException;
import java.util.*;

public class Main
{
    static PrintWriter pw = new PrintWriter(new BufferedWriter(new OutputStreamWriter(System.out)));
    static int N = (int)3000 + 10;
    static PII a[] = new PII[N];
    static Mycomparator cmp = new Mycomparator();

    public static void main(String[] args ) throws IOException, ParseException
    {
        int n = rd.nextInt();
        for(int i = 1; i <= n ; i ++)
        {
            int x = rd.nextInt();
            int y = rd.nextInt();
            a[i] = new PII(x,y);
        }

        Arrays.sort(a,1,n + 1,cmp);

        for(int i = 1 ; i <= n ; i ++)  pw.println(a[i].x + " " + a[i].y);
        pw.flush();
    }
}

class rd
{
    static BufferedReader reader = new BufferedReader(new InputStreamReader(System.in));
    static StringTokenizer tokenizer = new StringTokenizer("");

    static String nextLine() throws IOException  { return reader.readLine(); }

    static String next() throws IOException
    {
        while (!tokenizer.hasMoreTokens())  tokenizer = new StringTokenizer(reader.readLine());
        return tokenizer.nextToken();
    }

    static int nextInt() throws IOException  { return Integer.parseInt(next()); }

    static double nextDouble() throws IOException { return Double.parseDouble(next()); }

    static long nextLong() throws IOException  { return Long.parseLong(next());}

    static BigInteger nextBigInteger() throws IOException { return new BigInteger(rd.nextLine()); }
}

class PII
{
    int x,y;

    public PII(int x, int y)
    {
        this.x = x;
        this.y = y;
    }
}

// 手写cmp,万能,结构体里根本不用写接口
class Mycomparator implements Comparator<PII>
{
    @Override
    public int compare(PII o1, PII o2)
    {
        if(o1.x != o2.x)  return o1.x - o2.x; //  x不同,按x递增排序
        return o1.y - o2.y; // x相同,按y递增排序
    }
}

3、按照x关键字递减排序(y没有要求)

import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.OutputStreamWriter;
import java.io.PrintWriter;
import java.math.BigInteger;
import java.text.ParseException;
import java.util.*;

public class Main
{
    static PrintWriter pw = new PrintWriter(new BufferedWriter(new OutputStreamWriter(System.out)));
    static int N = (int)3000 + 10;
    static PII a[] = new PII[N];
    static Mycomparator cmp = new Mycomparator();

    public static void main(String[] args ) throws IOException, ParseException
    {
        int n = rd.nextInt();
        for(int i = 1; i <= n ; i ++)
        {
            int x = rd.nextInt();
            int y = rd.nextInt();
            a[i] = new PII(x,y);
        }

        Arrays.sort(a,1,n + 1,cmp);

        for(int i = 1 ; i <= n ; i ++)  pw.println(a[i].x + " " + a[i].y);
        pw.flush();
    }
}

class rd
{
    static BufferedReader reader = new BufferedReader(new InputStreamReader(System.in));
    static StringTokenizer tokenizer = new StringTokenizer("");

    static String nextLine() throws IOException  { return reader.readLine(); }

    static String next() throws IOException
    {
        while (!tokenizer.hasMoreTokens())  tokenizer = new StringTokenizer(reader.readLine());
        return tokenizer.nextToken();
    }

    static int nextInt() throws IOException  { return Integer.parseInt(next()); }

    static double nextDouble() throws IOException { return Double.parseDouble(next()); }

    static long nextLong() throws IOException  { return Long.parseLong(next());}

    static BigInteger nextBigInteger() throws IOException { return new BigInteger(rd.nextLine()); }
}

class PII
{
    int x,y;

    public PII(int x, int y)
    {
        this.x = x;
        this.y = y;
    }
}

// 手写cmp,万能,结构体里根本不用写接口
class Mycomparator implements Comparator<PII>
{
    @Override
    public int compare(PII o1, PII o2)
    {
        return o2.y - o1.y; //  y不同,按y递减排序
    }
}

4、按照x关键字递减排序(y要求递减)

import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.OutputStreamWriter;
import java.io.PrintWriter;
import java.math.BigInteger;
import java.text.ParseException;
import java.util.*;

public class Main
{
    static PrintWriter pw = new PrintWriter(new BufferedWriter(new OutputStreamWriter(System.out)));
    static int N = (int)3000 + 10;
    static PII a[] = new PII[N];
    static Mycomparator cmp = new Mycomparator();

    public static void main(String[] args ) throws IOException, ParseException
    {
        int n = rd.nextInt();
        for(int i = 1; i <= n ; i ++)
        {
            int x = rd.nextInt();
            int y = rd.nextInt();
            a[i] = new PII(x,y);
        }

        Arrays.sort(a,1,n + 1,cmp);

        for(int i = 1 ; i <= n ; i ++)  pw.println(a[i].x + " " + a[i].y);
        pw.flush();
    }
}

class rd
{
    static BufferedReader reader = new BufferedReader(new InputStreamReader(System.in));
    static StringTokenizer tokenizer = new StringTokenizer("");

    static String nextLine() throws IOException  { return reader.readLine(); }

    static String next() throws IOException
    {
        while (!tokenizer.hasMoreTokens())  tokenizer = new StringTokenizer(reader.readLine());
        return tokenizer.nextToken();
    }

    static int nextInt() throws IOException  { return Integer.parseInt(next()); }

    static double nextDouble() throws IOException { return Double.parseDouble(next()); }

    static long nextLong() throws IOException  { return Long.parseLong(next());}

    static BigInteger nextBigInteger() throws IOException { return new BigInteger(rd.nextLine()); }
}

class PII
{
    int x,y;

    public PII(int x, int y)
    {
        this.x = x;
        this.y = y;
    }
}

// 手写cmp,万能,结构体里根本不用写接口
class Mycomparator implements Comparator<PII>
{
    @Override
    public int compare(PII o1, PII o2)
    {
        if(o2.y != o1.y)  return o2.y - o1.y; //  y不同,按y递减排序
        return o2.x - o1.x; // y相同,按x递减排序
    }
}

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

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

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

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包

打赏作者

21RGHLY

你的鼓励将是我创作的最大动力

¥1 ¥2 ¥4 ¥6 ¥10 ¥20
扫码支付:¥1
获取中
扫码支付

您的余额不足,请更换扫码支付或充值

打赏作者

实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

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

余额充值